Selection-sort Source-Code

November 27th, 2007

Filed under: Algorithms — Unggul_USA @ 2:26 pm — View blog reactions

#include
#include
#define NUM_ITEMS 500
void selectionSort(int numbers[], int array_size);
int numbers[NUM_ITEMS];
int counter;
int main()
{
int i; //seed random number generator
srand(getpid()); //fill array with random integers
for (i = 0; i < NUM_ITEMS; i++)
numbers[i] = rand();
//selectionData(numbers, NUM_ITEMS);//perform selection sort on array
//counter=0;
selectionSort(numbers, NUM_ITEMS);//perform selection sort on array
for (i = 0; i < NUM_ITEMS; i++)
printf("%i\n", numbers[i]);
printf("Done with sort.\n");
printf("%i %i\n", i,counter);
}
void selectionData(int numbers[], int array_size)
{
int i, j;
int min, temp;
for (i = 0; i < array_size-1; i++)
{
min = i;
for (j = i+1; j < array_size; j++)
{
if (numbers[j] > numbers[min]) //nilai ekstrim ( < min/ > max )
min = j;
counter++;
}
temp = numbers[i];
numbers[i] = numbers[min];
numbers[min] = temp;
}
}
void selectionSort(int numbers[], int array_size)
{
int i, j;
int min, temp;
for (i = 0; i < array_size-1; i++)
{
min = i;
for (j = i+1; j < array_size; j++)
{
if (numbers[j] < numbers[min]) //nilai ekstrim ( < min/ >max )
min = j;
counter++;
}
temp = numbers[i];
numbers[i] = numbers[min];
numbers[min] = temp;
}
}