Selection-sort Source-Code

#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;
}
}

Inlinks:

• Data Security
• MD5 and SHA-1 ( Hash Function Chryptography )
• Apa itu Algorithms?
• SORTING ALGORITHM #1
• SORTING ALGORITHM ANALYSIS
• Sejarah Kriptografi
• Keamanan Informasi dan Kriptografi
• Quick-sort Source-Code
• Merge-sort Source-Code
• Insertion-sort Source-Code
• Selection-sort Source-Code
• Heap-sort Source-Code
• Bubble-sort Source-Code
• Enkripsi RC4 part 2
• Matrix-Chain-Multiply Source-Code
• Matrix-Chain-Order
• LINEAR DISCRIMINANT ANALYSIS (LDA)