Question

Sort the list of numbers: 35, 12, 6, 23, 18 using Selection sort. Work through each step of the algorithm. The algorithm for selection sort is as follows: i. Find the smallest item in a list. ii. Swap this value with the value currently at the front of the list. iii. Repeat Steps 1 and 2 with the current size of the list minus one (list size = list size-1)

Answer 1

#include <stdio.h>

void swap(int *first, int *second)
{
int temp = *first;
*first = *second;
*second = temp;
}

//print an array
void print(int array[], int size)
{
int i;
for (i=0; i < size; i++)
printf("%d ", array[i]);
printf("\n");
}

void selectionSort(int array[], int size)
{
int i, j, min;

// moving boundary of unsorted array one by one
for (i = 0; i < size-1; i++)
{
//finding minimum number in array
min = i;
for (j = i+1; j < size; j++)
if (array[j] < array[min])
min = j;
print(array, size);
// swapping minimum element with the first element
swap(&array[min], &array[i]);
}
}

int main()
{
int array[] = {35, 12, 6, 23, 18};
int size = sizeof(array)/sizeof(array[0]);
printf("Array: \n");
selectionSort(array, size);
return 0;
}