implementation of Bubble sort algorithm More...

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

Include dependency graph for bubble_sort_2.c:

Macros
#define	MAX 20
	for rand() calls for assert(<expr>)

Functions
void	bubble_sort (int *array_sort)
	Bubble sort implementation.

static void	test ()
	Test implementations.

int	main ()
	Main function.

Detailed Description

implementation of Bubble sort algorithm

worst-case: O(n^2) best-case: O(n) average-complexity: O(n^2)

Author: Unknown author; Gabriel Fioravante

Macro Definition Documentation

◆ MAX

#define MAX 20

for rand() calls for assert(<expr>)

for boolean values: true, false

Function Documentation

◆ bubble_sort()

void bubble_sort ( int * array_sort )

Bubble sort implementation.

Parameters

array_sort the array to be sorted

Returns: void

{
    bool is_sorted = false;
 
    /* keep iterating over entire array
     * and swaping elements out of order
     * until it is sorted */
    while (!is_sorted)
    {
        is_sorted = true;
 
        /* iterate over all elements */
        for (int i = 0; i < MAX - 1; i++)
        {
            /* check if adjacent elements are out of order */
            if (array_sort[i] > array_sort[i + 1])
            {
                /* swap elements */
                int change_place = array_sort[i];
                array_sort[i] = array_sort[i + 1];
                array_sort[i + 1] = change_place;
                /* elements out of order were found
                 * so we reset the flag to keep ordering
                 * until no swap operations are executed */
                is_sorted = false;
            }
        }
    }
}

◆ main()

int main ( void )

Main function.

Returns: 0 on exit

{
    test();  // run self-test implementations
    return 0;
}

Here is the call graph for this function:

◆ test()

static void test ( void )

static

Test implementations.

Returns: void

                   {
    /* simple int array for testing */
    int array_sort[MAX] = {0};
 
    /* populate our test array with 
     * random integer numbers */
    for (int i = 0; i < MAX; i++)
    {
        array_sort[i] = rand() % 101;
    }
 
    /* sort array */
    bubble_sort(array_sort);
 
    /* check if array ir correctly ordered */   
    for (int i = 0; i < MAX - 1; i++)
    {
        assert(array_sort[i] <= array_sort[i+1]);
    }
}