You are working on sorting function
 
search
 


Contents:


swap function:
Swapping two values to change their addresses.
a

max function:

The largest number among two.
a

absolute value function:

The positive value of a number.
a

sorting function:

How to sort an array.
a

bisection function:

Bissection method used to solve equations by computing, example of cable strung ..
a

Newton-Raphson function:

To solve equations numerically, example of free fall motion ..
a

Secant function:

To solve equations numerically, example of free fall motion ..
a

isPrime function:

This function tests whether an integer is prime..
a

abundant function:

This function tests whether an integer is abundant..
a

factorial function:

Factorial of an integer..
a

quadratic function:

solving a quadratic equation ..
a

even_odd function:

To know if an integer is even or odd ..
a

mean value function:

To calculate the arithmetic mean of some values..
a

reverse function:

To reverse an integer and to know whether a string is palindrome..
a

least squares function :

To calculate the slope and the y_intercept of a linear equation ..
a

Monte Carlo method:

To calculate integrales or probabilities using Monte Carlo technique ..
a

2 and 3 equations systems solving :

To solve the 2 and 3 equations systems with 2 and 3 variables ..
a

Interpolation and Extrapolation :

To solve for lacking values in graphs or tables ..
a

Integer divisors :

Gives the divisors fo an integer and tests whether it is prime ..
a

Amicable pair :

Gives, if it exists, the amicable number of a given integer ..
a

Perfect numbers :

Tests whether a positive integer is perfect, and more ..
a

Periodic table of elements:

Periodic table of elements in C language, and more ..
a

Playing TicTacToe

Using some Fortran90 language funtionalities, and more ..
a


a
home

   Sorting an array
sorting function
1. The method

	#include <stdio.h>
	#include <stdlib.h>
	#include <time.h>
	#define TOTAL 9

	int  main()
	{
	int i, j,size, seed;
	double numbers[TOTAL], temp;
	seed = time(NULL);
	srand(seed);
	printf("The random numbers are:n");

	for(i=0; i<TOTAL;i++)
	{
		numbers[i] = (double) rand()/(double) RAND_MAX;
		printf(" %1fn",numbers[i]);
		}


	for (size = TOTAL-1 ; size >= 0; size--)
	{
		for(j=0; j<=size-1; j++)
		{
		if (numbers[j] > numbers[j+1])
		{
		temp = numbers[j];
		numbers[j] = numbers[j+1];
		numbers[j+1] = temp;
		}
		}
	}


	printf("These numbers, sorted  are:n");
	for(i=0; i<TOTAL;i++)
	{
	printf("%1fn",numbers[i]);

	}
	return 0;

	}


	


Custom Search


© 2007. The scientificsentence . All rights reserved.