Crwld Lybraries
crmath.h v1.0.0 (17/02/08)
documentation v1.0
carlos raposo


1- float cmaxim(float * array, int array_size);
2- float cminim(float * array, int array_size);
3- float csum(float * array, int array_size);
4- float caverage(float * array, int array_size);
5- void csort_descending(float * array, int array_size);
6- void csort_ascending(float * array, int array_size);

1) Determines de maximum value in an array of numbers. The value is returned as float.

Code:
float cmaxim(float * array, int array_size) {
	int n;
	float max=array[0];
	for (n=0; n < array_size; n++) {
		if (max < array[n])
			max = array[n];
	}
	return max;
}


Example:
float array[4] = {1, 2, 3, 4};
float max = cmaxim(array, 4);


Output:

4


2) Determines de minimum value in an array of numbers. The value is returned as float.

Code:
float cminim(float * array, int array_size) {
	int n;
	float min=array[0];
	for (n=0; n < array_size; n++) {
		if (min > array[n])
			min = array[n];
	}
	return min;
}


Example:
float array[4] = {1, 2, 3, 4};
float min = cminim(array, 4);


Output:

1


3) Calculates the sum of all the numbers in an array. The value is returned as float.

Code:
float csum(float * array, int array_size) {
	int n;
	float sum = 0;
	for (n=0; n < array_size; n++)
		sum = sum + array[n];
	return sum;
}


Example:
float array[4] = {1, 2, 3, 4};
float sum = csum(array, 4);


Output:

10


4) Calculates the average of the numbers in an array. The value is returned as float.

Code:
float caverage(float * array, int array_size) {
	int n;
	float avrg = 0;
	for (n=0; n < array_size; n++)
		avrg = avrg + array[n];
	avrg = (avrg / array_size);
	return avrg;
}


Example:
float array[4] = {1, 2, 3, 4};
float average = caverage(array, 4);


Output:

2.5


5) It sorts an array of numbers into descending order.

Code:
void csort_descending(float * array, int array_size) {
	float MAX_N;
	int n, i, k=1, bool=0;
	for (n=0; n < array_size; n++) {
		MAX_N = array[n];
		int pos=0;
		for (i=k; i < array_size; i++) {
			if (array[i] > MAX_N) {
				MAX_N = array[i];
				pos = i;
				bool = 1;
			}
		}
		if (bool==1) {
			float tmp = array[n];
			array[n] = MAX_N;
			array[pos] = tmp;
			bool = 0;
		}
		if (k < array_size)
			k++;
	}
}


Example:
float array[4] = {2, 3.5, -5, 0};
csort_descending(array, 4);


Output:

3.5
2
0
-5


6) It sorts an array of numbers into ascending order.

Code:
void csort_ascending(float * array, int array_size) {
	float MIN_N;
	int n, i, k=1, bool=0;
	for (n=0; n < array_size; n++) {
		MIN_N = array[n];
		int pos=0;
		for (i=k; i < array_size; i++) {
			if (array[i] < MIN_N) {
				MIN_N = array[i];
				pos = i;
				bool = 1;
			}
		}
		if (bool==1) {
			float tmp = array[n];
			array[n] = MIN_N;
			array[pos] = tmp;
			bool = 0;
		}
		if (k < array_size)
			k++;
	}
}


Example:
float array[4] = {2, 3.5, -5, 0};
csort_ascending(array, 4);


Output:

-5
0
2
3.5