bubble_sort.c File Reference

Bubble sort algorithm implementation More...

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

Include dependency graph for bubble_sort.c:

Functions
void	display (const int *arr, int n)
	Display elements of array.
void	swap (int *first, int *second)
	Swap two values by using pointer.
void	bubbleSort (int *arr, int size)
	Bubble sort algorithm implementation.
void	test ()
	Test function.
int	main (int argc, const char *argv[])
	Driver Code.

Detailed Description

Bubble sort algorithm implementation

Function Documentation

bubbleSort()

void bubbleSort	(	int *	arr,
		int	size
	)

Bubble sort algorithm implementation.

Parameters

arr	array to be sorted
size	size of array

{
    for (int i = 0; i < size - 1; i++)
    {                         /* for each array index */
        bool swapped = false; /* flag to check if any changes had to be made */
        /* perform iterations until no more changes were made or outer loop
            executed for all array indices */
        for (int j = 0; j < size - 1 - i; j++)
        { /* for each element in the array */
            if (arr[j] > arr[j + 1])
            { /* if the order of successive elements needs update */
                swap(&arr[j], &arr[j + 1]);
                swapped = true; /* set flag */
            }
        }
        if (!swapped)
        {
            /* since no more updates we made, the array is already sorted
                this is an optimization for early termination */
            break;
        }
    }
}

display()

void display	(	const int *	arr,
		int	n
	)

Display elements of array.

Parameters

arr	array to be display
n	length of array

{
    for (int i = 0; i < n; i++)
    {
        printf("%d ", arr[i]);
    }
    printf("\n");
}

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:

swap()

void swap	(	int *	first,
		int *	second
	)

Swap two values by using pointer.

Parameters

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

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

test()

void test

(

void

)

Test function.

{
    const int size = 10;
    int *arr = (int *)calloc(size, sizeof(int));
 
    /* generate size random numbers from 0 to 100 */
    for (int i = 0; i < size; i++)
    {
        arr[i] = rand() % 100;
    }
    bubbleSort(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: