bubble_sort_recursion.c File Reference

Bubble sort algorithm implementation using recursion. More...

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

Include dependency graph for bubble_sort_recursion.c:

Functions
void	swap (int *first, int *second)
	Swapped two numbers using pointer.
void	bubbleSort (int *arr, int size)
	Bubble sort algorithm implements using recursion.
void	test ()
	Test function.
int	main ()
	Driver Code.

Detailed Description

Bubble sort algorithm implementation using recursion.

Function Documentation

bubbleSort()

void bubbleSort	(	int *	arr,
		int	size
	)

Bubble sort algorithm implements using recursion.

Parameters

arr	array to be sorted
size	size of array

{
    if (size == 1)
    {
        return;
    }
    bool swapped = false;
    for (int i = 0; i < size - 1; ++i)
    {
        if (arr[i] > arr[i + 1])
        {
            swap(arr + i, arr + i + 1);
            swapped = true;
        }
    }
    if (swapped)
    {
        bubbleSort(arr, size - 1);
    }
}

Here is the call graph for this function:

main()

int main

(

void

)

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
	)

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()

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: