OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

add namespace - sorting

Browse Source
This commit is contained in:
Krishna Vedala 2020-05-31 23:00:59 -04:00
parent 1125c85b3f
commit c2c4681554
1 changed files with 44 additions and 24 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

40
sorting/shell_sort2.cpp
View File

@ -1,11 +1,17 @@
/**
* \file
* \brief [Shell sort](https://en.wikipedia.org/wiki/Shell_sort) algorithm
*/
#include <array> #include <array>
#include <cstdlib> #include <cstdlib>
#include <ctime> #include <ctime>
#include <iostream> #include <iostream>
#include <utility> // for std::swap
// for std::swap /** pretty print array
#include <utility> * \param[in] arr array to print
* \param[in] LEN length of array to print
*/
template <class T> template <class T>
void show_data(T *arr, size_t LEN) { void show_data(T *arr, size_t LEN) {
size_t i; size_t i;
@ -14,17 +20,25 @@ void show_data(T *arr, size_t LEN) {
std::cout << std::endl; std::cout << std::endl;
} }
/** pretty print array
* \param[in] arr array to print
* \param[in] N length of array to print
*/
template <class T, size_t N> template <class T, size_t N>
void show_data(T (&arr)[N]) { void show_data(T (&arr)[N]) {
show_data(arr, N); show_data(arr, N);
} }
/** /** \namespace sorting
* \brief Sorting algorithms
*/
namespace sorting {
/**
* Optimized algorithm - takes half the time by utilizing * Optimized algorithm - takes half the time by utilizing
* Mar * Mar
**/ **/
template <class T> template <class T>
void shell_sort(T *arr, size_t LEN) { void shell_sort(T *arr, size_t LEN) {
const unsigned int gaps[] = {701, 301, 132, 57, 23, 10, 4, 1}; const unsigned int gaps[] = {701, 301, 132, 57, 23, 10, 4, 1};
const unsigned int gap_len = 8; const unsigned int gap_len = 8;
size_t i, j, g; size_t i, j, g;
@ -40,12 +54,18 @@ void shell_sort(T *arr, size_t LEN) {
arr[j] = tmp; arr[j] = tmp;
} }
} }
} }
template <class T, size_t N> /** function overload - when input array is of a known length array type
void shell_sort(T (&arr)[N]) { */
template <class T, size_t N>
void shell_sort(T (&arr)[N]) {
shell_sort(arr, N); shell_sort(arr, N);
} }
} // namespace sorting
using sorting::shell_sort;
/** /**
* function to compare sorting using cstdlib's qsort * function to compare sorting using cstdlib's qsort