insertion_sort.c File Reference

Insertion sort algorithm implementation. More...

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

Include dependency graph for insertion_sort.c:

Functions
void	insertionSort (int *arr, int size)
	Insertion sort algorithm implements.
static void	test ()
	Test function.
int	main (int argc, const char *argv[])

Detailed Description

Insertion sort algorithm implementation.

Function Documentation

insertionSort()

void insertionSort	(	int *	arr,
		int	size
	)

Insertion sort algorithm implements.

Parameters

arr	array to be sorted
size	size of array

{
    for (int i = 1; i < size; i++)
    {
        int j = i - 1;
        int key = arr[i];
        /* Move all elements greater than key to one position */
        while (j >= 0 && key < arr[j])
        {
            arr[j + 1] = arr[j];
            j = j - 1;
        }
        /* Find a correct position for key */
        arr[j + 1] = key;
    }
}

main()

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

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

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 */
    }
    insertionSort(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: