mirror of https://github.com/TheAlgorithms/C
76 lines
1.5 KiB
C
76 lines
1.5 KiB
C
/**
|
|
* @file
|
|
* @brief [Selection sort](https://en.wikipedia.org/wiki/Selection_sort)
|
|
* algorithm implementation.
|
|
*/
|
|
#include <assert.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <time.h>
|
|
|
|
/**
|
|
* Swapped two numbers using pointer
|
|
* @param first first pointer of first number
|
|
* @param second second pointer of second number
|
|
*/
|
|
void swap(int *first, int *second)
|
|
{
|
|
int temp = *first;
|
|
*first = *second;
|
|
*second = temp;
|
|
}
|
|
|
|
/**
|
|
* Selection sort algorithm implements
|
|
* @param arr array to be sorted
|
|
* @param size size of array
|
|
*/
|
|
void selectionSort(int *arr, int size)
|
|
{
|
|
for (int i = 0; i < size - 1; i++)
|
|
{
|
|
int min_index = i;
|
|
for (int j = i + 1; j < size; j++)
|
|
{
|
|
if (arr[min_index] > arr[j])
|
|
{
|
|
min_index = j;
|
|
}
|
|
}
|
|
if (min_index != i)
|
|
{
|
|
swap(arr + i, arr + min_index);
|
|
}
|
|
}
|
|
}
|
|
|
|
/** Test function
|
|
* @returns None
|
|
*/
|
|
static void test()
|
|
{
|
|
const int size = rand() % 500; /* random array size */
|
|
int *arr = (int *)calloc(size, sizeof(int));
|
|
|
|
/* generate size random numbers from -50 to 49 */
|
|
for (int i = 0; i < size; i++)
|
|
{
|
|
arr[i] = (rand() % 100) - 50; /* signed random numbers */
|
|
}
|
|
selectionSort(arr, size);
|
|
for (int i = 0; i < size - 1; ++i)
|
|
{
|
|
assert(arr[i] <= arr[i + 1]);
|
|
}
|
|
free(arr);
|
|
}
|
|
|
|
/** Driver Code */
|
|
int main(int argc, const char *argv[])
|
|
{
|
|
/* Intializes random number generator */
|
|
srand(time(NULL));
|
|
test();
|
|
return 0;
|
|
}
|