1. Bubble-sort Source-Code
#include <stdio.h>
#include <conio.h>
#define NUM_ITEMS 1000
void bubbleSort(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();
bubbleSort(numbers,NUM_ITEMS);//perform bubble 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 bubbleSort(int numbers[],int array_size)
{
int i,j,temp;
for (i = (array_size –1);i >= 0;i–)
{
for (j = 1;j <= i;j++)
{
if (numbers[j-1] >numbers[j])
{
temp = numbers[j-1];
numbers[j-1] = numbers[j];
numbers[j] = temp;
}
counter++;
}
counter++;
}
getch();
}
2. Merge-sort Source-Code
#include <stdio.h>
#include <conio.h>
#define NUM_ITEMS 100
void mergeSort(int numbers[],int temp[],int array_size);
void m_sort(int numbers[],int temp[],int left,int right);
void merge(int numbers[],int temp[],int left,int mid,int right);
int numbers[NUM_ITEMS];
int temp[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();
mergeSort(numbers,temp,NUM_ITEMS);//perform merge 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 mergeSort(int numbers[],int temp[],int array_size)
{
m_sort(numbers,temp,0,array_size - 1);
}
void m_sort(int numbers[],int temp[],int left,int right)
{
int mid;
if (right > left)
{
mid = (right + left) / 2;
m_sort(numbers,temp,left,mid);
m_sort(numbers,temp,mid+1,right);
merge(numbers,temp,left,mid+1,right);
}
counter++;
}
void merge(int numbers[],int temp[],int left,int mid,int right)
{
int i,left_end,num_elements,tmp_pos;
left_end = mid –1;
tmp_pos = left;
num_elements = right –left + 1;
while ((left <= left_end) &&(mid <= right))
{
if (numbers[left] <= numbers[mid])
{
temp[tmp_pos] = numbers[left];
tmp_pos = tmp_pos + 1;
left = left +1;
}
else
{
temp[tmp_pos] = numbers[mid];
tmp_pos = tmp_pos + 1;
mid = mid + 1;
}
counter++;
}
while (left <= left_end)
{
temp[tmp_pos] = numbers[left];
left = left + 1;
tmp_pos = tmp_pos + 1;
counter++;
}
while (mid <= right)
{
temp[tmp_pos] = numbers[mid];
mid = mid + 1;
tmp_pos = tmp_pos + 1;
counter++;
}
for (i=0;i <= num_elements;i++)
{
numbers[right] = temp[right];
right = right - 1;
counter++;
}
getch();
}
3. Quick-sort Source-Code
#include <stdlib.h>
#include <stdio.h>
#include <time.h>
#define NUM_ITEMS 51
void quickSort(int numbers[],int array_size);
void q_sort(int numbers[],int left,int right);
int numbers[NUM_ITEMS];
int counter;
// timestart,timestop;
int main()
{
int i;//seed random number generator
srand(getpid());//fill array with random integers
//printf(time());
for (i = 0;i <NUM_ITEMS;i++)
numbers[i] = rand();
quickSort(numbers,NUM_ITEMS);//perform quick sort on array
counter=0;
quickSort(numbers,NUM_ITEMS);//perform quick sort on array
for (i = 0;i <NUM_ITEMS;i++)
printf(“%i\n”,numbers[i]);
//timestop = time();
printf(“Done with sort.\n”);
printf(“%i %i\n”,i,counter);
//printf(“%u %u\n”,timestart,timestop);
}
void quickSort(int numbers[],int array_size)
{
q_sort(numbers,0,array_size –1);
}
void q_sort(int numbers[],int left,int right)
{
int pivot,l_hold,r_hold;
l_hold = left;
r_hold = right;
pivot = numbers[left];
while (left <right)
{
while ((numbers[right] >= pivot) &&(left <right))
right–;
if (left != right)
{
numbers[left] = numbers[right];
left++;
}
counter++;
while ((numbers[left] <= pivot) &&(left <right))
left++;
if (left != right)
{
numbers[right] = numbers[left];
right–;
}
counter++;
}
numbers[left] = pivot;
pivot = left;
left = l_hold;
right = r_hold;
if (left <pivot)
q_sort(numbers,left,pivot-1);
if (right >pivot)
q_sort(numbers,pivot+1,right);
}
4. 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;
}
}
