selection_sort.c File Reference

Selection sort algorithm implementation. More...

#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>

Include dependency graph for selection_sort.c:

Functions
void	swap (int *first, int *second)
	Swapped two numbers using pointer.
void	selectionSort (int *arr, int size)
	Selection sort algorithm implements.
static void	test ()
	Test function.
int	main (int argc, const char *argv[])
	Driver Code.

Detailed Description

Selection sort algorithm implementation.

Function Documentation

main()

int main	(	int	argc,
		const char *	argv[]
	)

Driver Code.

{
    /* Intializes random number generator */
    srand(time(NULL));
    test();
    return 0;
}

Here is the call graph for this function:

selectionSort()

void selectionSort	(	int *	arr,
		int	size
	)

Selection sort algorithm implements.

Parameters

arr	array to be sorted
size	size of array

{
    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);
        }
    }
}

swap()

void swap	(	int *	first,
		int *	second
	)

Swapped two numbers using pointer.

Parameters

first	first pointer of first number
second	second pointer of second number

{
    int temp = *first;
    *first = *second;
    *second = temp;
}

test()

static void test ( void  )

static

Test function.

Returns

None

{
    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);
}

Here is the call graph for this function: