#include
#include
#define NUM_ITEMS 100
void insertionSort(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();
insertionSort(numbers, NUM_ITEMS); //perform insertion 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 insertionSort(int numbers[], int array_size)
{
int i, j, index;
for (i=1; i < array_size; i++)
{
index = numbers[i];
j = i;
while ((j > 0) && (numbers[j-1] > index))
{
numbers[j] = numbers[j-1];
j = j - 1;
counter++;
}
numbers[j] = index;
}
}

Inlinks :

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

1,264 Views