Managed C++/CLI

Code: 
private static void SetWIAProperty(IProperties properties, object propName, object propValue)
{
        Property prop = properties.get_Item(ref propName);
        prop.set_Value(ref propValue);
}

UNI.S.fTestValue1

UNI.S.fTestValue2

unsigned char* CSendValue :: SendLiveValues()
{
union USendLive
	{
		struct SSend
		{
			float fTestValue1;
			float fTestValue2;	
			char cChr;			
		}S;						
		unsigned char Buffer[LIVEUNISIZE];
	}UNI;

	memset(UNI.Buffer,0,LIVEUNISIZE);
	
	float fLocalValue;
	float fTest;

	fTest 		        = 190.000015f;

	fLocalValue	        = fTest;   		//190.000015    // Correct value
	UNI.S.cChr 	        = 'c';			//'Ô'           // Junk value - Wrong
	UNI.S.fTestValue1 	= fTest;		//6.360e-39#DEN // Junk value - Wrong
	UNI.S.fTestValue2 	= 190.000015f;		//1.401e-45#DEN // Junk value - Wrong

        return UNI.Buffer;    
}

#include <stdio.h>
#include <conio.h>

int inc_order(int num[], int count, int i);
int compare(int hole, int value, int num[]);

int main(){
	int num[50], n, count, j, i=0;

	printf("Number of integers: \t");
	scanf("%d", &count);

	printf("\nEnter your integers: \n");

	for(n=0; n<count; n++){
		scanf("%d", &num[n]);
	}
	
	inc_order(num, count, i);
	
	for(j=0; j<count; j++){
		printf("%d", num[j]);
	}
	
	return 0;
}

int i=1;

void inc_order(int num[], int count, int i){
	int value, hole;
	
	if(i<count){
		value = num[i];
		hole = i;
	}
	
	compare(hole, value, num);
	inc_order(num, count, i++);
}

int compare(int hole, int value, int num[]){
	
	if(hole==0){
		num[hole]=value;
		return(num[hole]);
	}
	
	if(num[hole-1]>value){
		num[hole] = num[hole-1];
		hole--;
	}
	
	compare(hole, value, num);
}

#include <conio.h>
#include <stdio.h>

int main(){
	int i=0, j, num[100], count=0, k, hcf[50], min;

	//entering integers, Enter 0 to exit the loop.

	printf("Enter your numbers: \n");

	do{
		scanf("%d", &num[i]);
		i++;
		count++;

	}while(num[i-1]!=0);

	/*
	here we find the minimum number, because we want to find the common factor, hence the factor
	cannot be > min number entered cause then it will not be common factor in all.
	Therefore the min number enterd can be the highest factor or the factors can be <= the min int 
	entered.
	*/

	min = num[0];

	for(j=1; j<=count-2; j++){

		if(min>num[j])
			min = num[j];
	}

	//in the code below we find the factors of every integer entered.

	int h=0, n[count-1];

	for(j=0; j<=count-2; j++){

		for(k=1; k<=min; k++){

				if(num[j]%k==0){
					hcf[h]=k;
					h++;
				}
			}

			n[j] = h;	/*here h is the the size of the number of factors for every integer 
							which is saved in n[] array*/
	}

	/*
	In the loop below each factor of the 1st integer is compared with the factors of others number, 
	And if the occurance of any factor of 1st is equal to the number of int intitially
	enterd then that is a common factor an it is saved in max[] array
	*/

	int c=0, max[50], z;

	for(i=0; i<n[0]; i++){

        z=0;

		for(j=n[0]; j<h; j++){

			if(hcf[i]==hcf[j]){	 //here where a factor is checked if it appears in all the int enterd.
                    z++;
            }
        }
        if(z==(count-2)){	
            max[c]=hcf[i];	//here is where all the common factors are saved.
            c++;
        }

	}

	//In the code below the highest of the common factors is founded.

	for(i=1; i<c; i++){

        if(max[0]<max[i])
            max[0]=max[i];
	}

	//Hcf is printed.

	printf("\nHcf : %d\n", max[0]);

	return 0;
}

<pre lang="c++"><pre lang="c++"><pre lang="c++"><pre lang="c++"><pre lang="c++"><pre lang="c++"><pre lang="c++">