sorting Namespace Reference

for working with vectors More...

Functions
template<class T >
int64_t	binary_search (std::vector< T > &arr, T val, int64_t low, int64_t high)
	Binary search function to find the most suitable pace for an element.
template<typename T >
void	insertionSort_binsrch (std::vector< T > &arr)
	Insertion sort function to sort the vector.
template<typename T , size_t N>
std::array< T, N >	shuffle (std::array< T, N > arr)
template<typename T , size_t N>
std::array< T, N >	randomized_bogosort (std::array< T, N > arr)
template<typename T >
void	gnomeSort (T *arr, int size)
template<typename T , size_t size>
std::array< T, size >	gnomeSort (std::array< T, size > arr)
template<typename T >
void	insertionSort (T *arr, int n)
	Insertion Sort Function.
template<typename T >
void	insertionSort (std::vector< T > *arr)
template<class Iterator >
void	merge (Iterator l, Iterator r, const Iterator e, char b[])
	merges 2 sorted adjacent segments into a larger sorted segment
template<class Iterator >
void	non_recursive_merge_sort (const Iterator first, const Iterator last, const size_t n)
	bottom-up merge sort which sorts elements in a non-decreasing order
template<class Iterator >
void	non_recursive_merge_sort (const Iterator first, const size_t n)
	bottom-up merge sort which sorts elements in a non-decreasing order
template<class Iterator >
void	non_recursive_merge_sort (const Iterator first, const Iterator last)
	bottom-up merge sort which sorts elements in a non-decreasing order
template<std::size_t N>
std::array< int, N >	pigeonSort (std::array< int, N > arr)
template<typename T >
void	quicksort (std::vector< T > *arr, int32_t low, int32_t high)
template<typename T >
std::vector< T >	quicksort (std::vector< T > arr, int32_t low, int32_t high)
template<typename T >
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 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.
std::vector< uint64_t >	selectionSort (const std::vector< uint64_t > &arr, uint64_t len)
template<typename T >
void	shell_sort (T *arr, size_t LEN)
template<typename T , size_t N>
void	shell_sort (T(&arr)[N])
template<typename T >
void	shell_sort (std::vector< T > *arr)

Detailed Description

for working with vectors

for io operations

for std::is_sorted

for returning multiple values form a function at once

Sorting Algorithms.

for std::vector

Sorting algorithms.

for algorithm functions for assert for IO operations

Sorting algorithms

for assert for typedef datatype uint64_t for IO operations

Sorting algorithms

for std::is_sorted, std::swap for assert for io operations

Sorting algorithms

for std::is_sorted for assert for std::swap and io operations

@breif Sorting algorithms

Sorting algorithms

for std::is_sorted for std::assert for std::time for IO operations

Sorting algorithms

header files for collection of functions for a macro called assert which can be used to verify assumptions for io operations

Sorting algorithms

for std::is_sorted(), std::swap() for std::array for assert for initializing random number generator for IO operations

Sorting algorithms

for assert for IO operations for std::vector for std::array

Sorting algorithms

for std::is_sorted for std::assert for IO operations

for std::is_sorted for assert for std::swap and io operations

Sorting algorithms

for std::is_sorted, std::swap for assert for IO operations

Sorting algorithms

Function Documentation

binary_search()

template<class T >

int64_t sorting::binary_search	(	std::vector< T > &	arr,
		T	val,
		int64_t	low,
		int64_t	high )

Binary search function to find the most suitable pace for an element.

Template Parameters

T	The generic data type.

Parameters

arr	The actual vector in which we are searching a suitable place for the element.
val	The value for which suitable place is to be found.
low	The lower bound of the range we are searching in.
high	The upper bound of the range we are searching in.

Returns

the index of most suitable position of val.

                                                                           {
    if (high <= low) {
        return (val > arr[low]) ? (low + 1) : low;
    }
    int64_t mid = low + (high - low) / 2;
    if (arr[mid] > val) {
        return binary_search(arr, val, low, mid - 1);
    } else if (arr[mid] < val) {
        return binary_search(arr, val, mid + 1, high);
    } else {
        return mid + 1;
    }
}

Here is the call graph for this function:

gnomeSort() [1/2]

template<typename T , size_t size>

std::array< T, size > sorting::gnomeSort

(

std::array< T, size >

arr

)

This implementation is for a C++-style array input. The function argument is a pass-by-value and hence a copy of the array gets created which is then modified by the function and returned.

Template Parameters

T	type of data variables in the array
size	size of the array

Parameters

[in]

arr

our array of elements.

Returns

array with elements sorted

                                                   {
    // few easy cases
    if (size <= 1) {
        return arr;
    }
 
    int index = 0;  // initialize loop index
    while (index < size) {
        // check for swap
        if ((index == 0) || (arr[index] >= arr[index - 1])) {
            index++;
        } else {
            std::swap(arr[index], arr[index - 1]);  // swap
            index--;
        }
    }
    return arr;
}

Here is the call graph for this function:

gnomeSort() [2/2]

template<typename T >

void sorting::gnomeSort	(	T *	arr,
		int	size )

This implementation is for a C-style array input that gets modified in place.

Parameters

[in,out]	arr	our array of elements.
	size	size of given array

                                 {
    // few easy cases
    if (size <= 1) {
        return;
    }
 
    int index = 0;  // initialize some variables.
    while (index < size) {
        // check for swap
        if ((index == 0) || (arr[index] >= arr[index - 1])) {
            index++;
        } else {
            std::swap(arr[index], arr[index - 1]);  // swap
            index--;
        }
    }
}

Here is the call graph for this function:

insertionSort() [1/2]

template<typename T >

void sorting::insertionSort

(

std::vector< T > *

arr

)

Insertion Sort Function

Template Parameters

T	type of array

Parameters

[in,out]

arr

pointer to array to be sorted

                                      {
    size_t n = arr->size();
 
    for (size_t i = 1; i < n; i++) {
        T temp = arr[0][i];
        int32_t j = i - 1;
        while (j >= 0 && temp < arr[0][j]) {
            arr[0][j + 1] = arr[0][j];
            j--;
        }
        arr[0][j + 1] = temp;
    }
}

Here is the call graph for this function:

insertionSort() [2/2]

template<typename T >

void sorting::insertionSort	(	T *	arr,
		int	n )

Insertion Sort Function.

Template Parameters

T	type of array

Parameters

[in,out]	arr	Array to be sorted
	n	Size of Array

                                  {
    for (int i = 1; i < n; i++) {
        T temp = arr[i];
        int j = i - 1;
        while (j >= 0 && temp < arr[j]) {
            arr[j + 1] = arr[j];
            j--;
        }
        arr[j + 1] = temp;
    }
}

insertionSort_binsrch()

template<typename T >

void sorting::insertionSort_binsrch

(

std::vector< T > &

arr

)

Insertion sort function to sort the vector.

Template Parameters

T	The generic data type.

Parameters

arr	The actual vector to sort.

Returns

Void.

                                              {
    int64_t n = arr.size();
 
    for (int64_t i = 1; i < n; i++) {
        T key = arr[i];
        int64_t j = i - 1;
        int64_t loc = sorting::binary_search(arr, key, 0, j);
        while (j >= loc) {
            arr[j + 1] = arr[j];
            j--;
        }
        arr[j + 1] = key;
    }
}

Here is the call graph for this function:

merge()

template<class Iterator >

void sorting::merge	(	Iterator	l,
		Iterator	r,
		const Iterator	e,
		char	b[] )

merges 2 sorted adjacent segments into a larger sorted segment

best-case = worst-case = O(n)

Parameters

l	points to the left part
r	points to the right part, end of left part
e	points to end of right part
b	points at the buffer

                                                               {
    // create 2 pointers to point at the buffer
    auto p(reinterpret_cast<std::remove_reference_t<decltype(*l)>*>(b)), c(p);
    // move the left part of the segment
    for (Iterator t(l); r != t; ++t) *p++ = std::move(*t);
    // while neither the buffer nor the right part has been exhausted
    // move the smallest element of the two back to the container
    while (e != r && c != p) *l++ = std::move(*r < *c ? *r++ : *c++);
    // notice only one of the two following loops will be executed
    // while the right part hasn't bee exhausted, move it back
    while (e != r) *l++ = std::move(*r++);
    // while the buffer hasn't bee exhausted, move it back
    while (c != p) *l++ = std::move(*c++);
}

Here is the call graph for this function:

non_recursive_merge_sort() [1/3]

template<class Iterator >

void sorting::non_recursive_merge_sort	(	const Iterator	first,
		const Iterator	last )

bottom-up merge sort which sorts elements in a non-decreasing order

Parameters

first	points to the first element
last	points to 1-step past the last element

                                                                         {
    non_recursive_merge_sort(first, last, last - first);
}

Here is the call graph for this function:

non_recursive_merge_sort() [2/3]

template<class Iterator >

void sorting::non_recursive_merge_sort	(	const Iterator	first,
		const Iterator	last,
		const size_t	n )

bottom-up merge sort which sorts elements in a non-decreasing order

sorts elements non-recursively by breaking them into small segments, merging adjacent segments into larger sorted segments, then increasing the sizes of segments by factors of 2 and repeating the same process. best-case = worst-case = O(n log(n))

Parameters

first	points to the first element
last	points to 1-step past the last element
n	the number of elements

                                              {
    // create a buffer large enough to store all elements
    // dynamically allocated to comply with cpplint
    char* buffer = new char[n * sizeof(*first)];
    // buffer size can be optimized to largest power of 2 less than n
    // elements divide the container into equally-sized segments whose
    // length start at 1 and keeps increasing by factors of 2
    for (size_t length(1); length < n; length <<= 1) {
        // merge adjacent segments whose number is n / (length * 2)
        Iterator left(first);
        for (size_t counter(n / (length << 1)); counter; --counter) {
            Iterator right(left + length), end(right + length);
            merge(left, right, end, buffer);
            left = end;
        }
        // if the number of remaining elements (n * 2 % length) is longer
        // than a segment, merge the remaining elements
        if ((n & ((length << 1) - 1)) > length)
            merge(left, left + length, last, buffer);
    }
    delete[] buffer;
}

Here is the call graph for this function:

non_recursive_merge_sort() [3/3]

template<class Iterator >

void sorting::non_recursive_merge_sort	(	const Iterator	first,
		const size_t	n )

bottom-up merge sort which sorts elements in a non-decreasing order

Parameters

first	points to the first element
n	the number of elements

                                                                    {
    non_recursive_merge_sort(first, first + n, n);
}

Here is the call graph for this function:

pigeonSort()

template<std::size_t N>

std::array< int, N > sorting::pigeonSort

(

std::array< int, N >

arr

)

Pigeonhole sorting of array of size n The function will sort the array through Pigeonhole algorithm and print

Parameters

arr	unsorted array of elements

Returns

sorted array of elements

                                                  {
    // Finding min and max*
    auto min = std::min_element(std::begin(arr), std::end(arr));
    auto max = std::max_element(std::begin(arr), std::end(arr));
 
    // Range refers to the number of holes required
    int range = *max - *min + 1;
    int *hole = new int[range]();
 
    // Copying all array values to pigeonhole
    for (int i = 0; i < N; i++) {
        hole[arr[i] - *min] = arr[i];
    }
 
    // Deleting elements from list and storing to original array
    int count = 0;
    for (int i = 0; i < range; i++) {
        while (hole[i] != '\0') {
            arr[count] = hole[i];
            hole[i] = {};
            count++;
        }
    }
    delete[] hole;
 
    return arr;
}

Here is the call graph for this function:

quicksort() [1/2]

template<typename T >

void sorting::quicksort	(	std::vector< T > *	arr,
		int32_t	low,
		int32_t	high )

3-way partition based quick sort. This function accepts array pointer and modified the input array.

Template Parameters

T	type of data in the vector array

Parameters

[in,out]	arr	vector array to sort
[in]	low	lower limit of window to partition
[in]	high	upper limit of window to partition

                                                             {
    if (low >= high) {  // 1 or 0 elements
        return;
    }
 
    int32_t i = 0, j = 0;
 
    // i and j are passed as reference
    partition3(arr, low, high, &i, &j);
 
    // Recur two halves
    quicksort(arr, low, i);
    quicksort(arr, j, high);
}

Here is the call graph for this function:

quicksort() [2/2]

template<typename T >

std::vector< T > sorting::quicksort	(	std::vector< T >	arr,
		int32_t	low,
		int32_t	high )

3-way partition based quick sort. This function accepts array by value and creates a copy of it. The array copy gets sorted and returned by the function.

Template Parameters

T	type of data in the vector array

Parameters

[in]	arr	vector array to sort
[in]	low	lower limit of window to partition
[in]	high	upper limit of window to partition

Returns

sorted array vector

                                                                    {
    if (low >= high) {  // 1 or 0 elements
        return arr;
    }
 
    int32_t i = 0, j = 0;
 
    // i and j are passed as reference
    partition3(&arr, low, high, &i, &j);
 
    // Recur two halves
    quicksort(&arr, low, i);
    quicksort(&arr, j, high);
 
    return arr;
}

Here is the call graph for this function:

randomized_bogosort()

template<typename T , size_t N>

std::array< T, N > sorting::randomized_bogosort

(

std::array< T, N >

arr

)

Implement randomized Bogosort algorithm and sort the elements of a given array.

Template Parameters

T	typename of the array
N	length of array

Parameters

arr	array to sort

Returns

new array with elements sorted from a given array

                                                          {
    // Untill array is not sorted
    while (!std::is_sorted(arr.begin(), arr.end())) {
        std::random_shuffle(arr.begin(), arr.end());// Shuffle the array
    }
    return arr;
}

Here is the call graph for this function:

recursive_bubble_sort()

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.

Template Parameters

T	type of data variables in the array

Parameters

nums	our array of elements.
n	size of the array

< base case; when size of the array is 1

< iterating over the entire array

< if a larger number appears before the smaller one, swap them.

                                                           {
    if (n == 1) {  //!< base case; when size of the array is 1
        return;
    }
 
    for (uint64_t i = 0; i < n - 1; i++) {  //!< iterating over the entire array
        //!< if a larger number appears before the smaller one, swap them.
        if ((*nums)[i] > (*nums)[i + 1]) {
            std::swap((*nums)[i], (*nums)[i + 1]);
        }
    }
 
    //!< calling the function after we have fixed the last element
    recursive_bubble_sort(nums, n - 1);
}

Here is the call graph for this function:

selectionSort()

std::vector< uint64_t > sorting::selectionSort	(	const std::vector< uint64_t > &	arr,
		uint64_t	len )

                                                  {
    std::vector<uint64_t> array(
        arr.begin(),
        arr.end());  // declare a vector in which result will be stored
    for (uint64_t it = 0; it < len; ++it) {
        uint64_t min = it;  // set min value
        for (uint64_t it2 = it + 1; it2 < len; ++it2) {
            if (array[it2] < array[min]) {  // check which element is smaller
                min = it2;  // store index of smallest element to min
            }
        }
 
        if (min != it) {  // swap if min does not match to i
            uint64_t tmp = array[min];
            array[min] = array[it];
            array[it] = tmp;
        }
    }
 
    return array;  // return sorted vector
}

shell_sort() [1/3]

template<typename T >

void sorting::shell_sort

(

std::vector< T > *

arr

)

function overload - when input array is of type std::vector, simply send the data content and the data length to the above function.

                                   {
    shell_sort(arr->data(), arr->size());
}

Here is the call graph for this function:

shell_sort() [2/3]

template<typename T >

void sorting::shell_sort	(	T *	arr,
		size_t	LEN )

Optimized algorithm - takes half the time by utilizing Mar

                                    {
    const unsigned int gaps[] = {701, 301, 132, 57, 23, 10, 4, 1};
    const unsigned int gap_len = 8;
    size_t i, j, g;
 
    for (g = 0; g < gap_len; g++) {
        unsigned int gap = gaps[g];
        for (i = gap; i < LEN; i++) {
            T tmp = arr[i];
 
            for (j = i; j >= gap && (arr[j - gap] - tmp) > 0; j -= gap) {
                arr[j] = arr[j - gap];
            }
 
            arr[j] = tmp;
        }
    }
}

shell_sort() [3/3]

template<typename T , size_t N>

void sorting::shell_sort

(

T(&)

arr[N]

)

function overload - when input array is of a known length array type

                             {
    shell_sort(arr, N);
}

Here is the call graph for this function:

shuffle()

template<typename T , size_t N>

std::array< T, N > sorting::shuffle

(

std::array< T, N >

arr

)

Function to shuffle the elements of an array. (for reference)

Template Parameters

T	typename of the array
N	length of array

Parameters

arr	array to shuffle

Returns

new array with elements shuffled from a given array

                                              {
    for (int i = 0; i < N; i++) {
        // Swaps i'th  index with random index (less than array size)
        std::swap(arr[i], arr[std::rand() % N]);
    }
    return arr;
}

Here is the call graph for this function: