Algorithms_in_C++ 1.0.0
Set of algorithms implemented in C++.
Loading...
Searching...
No Matches
recursive_bubble_sort.cpp File Reference

This is an implementation of a recursive version of the Bubble sort algorithm More...

#include <cassert>
#include <iostream>
#include <vector>
#include <array>
#include <algorithm>
Include dependency graph for recursive_bubble_sort.cpp:

Namespaces

namespace  sorting
 for working with vectors
 

Functions

template<typename T >
void sorting::recursive_bubble_sort (std::vector< T > *nums, uint64_t n)
 This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is then dereferenced, so that the changes are reflected in the original vector. It also accepts a second parameter of type int and name n, which is the size of the array.
 
static void test ()
 Self-test implementations.
 
int main ()
 Main function.
 

Detailed Description

This is an implementation of a recursive version of the Bubble sort algorithm

Author
Aditya Prakash

The working principle of the Bubble sort algorithm.

Bubble sort is a simple sorting algorithm used to rearrange a set of ascending or descending order elements. Bubble sort gets its name from the fact that data "bubbles" to the top of the dataset.

Algorithm

What is Swap?

Swapping two numbers means that we interchange their values. Often, an additional variable is required for this operation. This is further illustrated in the following:

void swap(int x, int y){ int z = x; x = y; y = z; }

The above process is a typical displacement process. When we assign a value to x, the old value of x is lost. That's why we create a temporary variable z to store the initial value of x. z is further used to assign the initial value of x to y, to complete swapping.

Recursion

While the recursive method does not necessarily have advantages over iterative versions, but it is useful to enhance the understanding of the algorithm and recursion itself. In Recursive Bubble sort algorithm, we firstly call the function on the entire array, and for every subsequent function call, we exclude the last element. This fixes the last element for that sub-array.Formally, for ith iteration, we consider elements up to n-i, where n is the number of elements in the array. Exit condition: n==1; i.e. the sub-array contains only one element.

Complexity Time complexity: O(n) best case; O(n²) average case; O(n²) worst case Space complexity: O(n)

We need to traverse the array n * (n-1) times. However, if the entire array is already sorted, then we need to traverse it only once. Hence, O(n) is the best case complexity

Function Documentation

◆ main()

int main ( void )

Main function.

Returns
0 on exit
146 {
147 test(); // run self-test implementations
148 return 0;
149}
static void test()
Self-test implementations.
Definition recursive_bubble_sort.cpp:95
Here is the call graph for this function:

◆ test()

static void test ( )
static

Self-test implementations.

Returns
void
95 {
96 // 1st example. Creating an array of type `int`.
97 std::cout << "1st test using `int`\n";
98 const uint64_t size = 6;
100 // populating the array
101 arr.push_back(22);
102 arr.push_back(46);
103 arr.push_back(94);
104 arr.push_back(12);
105 arr.push_back(37);
106 arr.push_back(63);
107 // array populating ends
108
110 assert(std::is_sorted(std::begin(arr), std::end(arr)));
111 std::cout << " 1st test passed!\n";
112 // printing the array
113 for (uint64_t i = 0; i < size; i++) {
114 std::cout << arr[i] << ", ";
115 }
117
118 // 2nd example. Creating an array of type `double`.
119 std::cout << "2nd test using doubles\n";
120 std::vector<double> double_arr;
121
122 // populating the array
123 double_arr.push_back(20.4);
124 double_arr.push_back(62.7);
125 double_arr.push_back(12.2);
126 double_arr.push_back(43.6);
127 double_arr.push_back(74.1);
128 double_arr.push_back(57.9);
129 // array populating ends
130
131 sorting::recursive_bubble_sort(&double_arr, size);
132 assert(std::is_sorted(std::begin(double_arr), std::end(double_arr)));
133 std::cout << " 2nd test passed!\n";
134 // printing the array
135 for (uint64_t i = 0; i < size; i++) {
136 std::cout << double_arr[i] << ", ";
137 }
139
140}
T begin(T... args)
T end(T... args)
T endl(T... args)
T is_sorted(T... args)
void recursive_bubble_sort(std::vector< T > *nums, uint64_t n)
This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is t...
Definition recursive_bubble_sort.cpp:74
T push_back(T... args)
Here is the call graph for this function: