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 assertions'

Browse Source
This commit is contained in:
Krishna Vedala 2020-07-17 21:10:32 -04:00
parent afbe4c99a7
commit d9c87d59e0
No known key found for this signature in database
GPG Key ID: BA19ACF8FC8792F7
1 changed files with 15 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
sorting/gnome_sort.cpp
View File

@ -17,6 +17,7 @@
#include <algorithm> // for std::swap #include <algorithm> // for std::swap
#include <array> // for std::array #include <array> // for std::array
#include <cassert> // for assertions
#include <iostream> // for io operations #include <iostream> // for io operations
/** /**
@ -32,7 +33,8 @@ namespace sorting {
template <typename T> template <typename T>
void gnomeSort(T *arr, int size) { void gnomeSort(T *arr, int size) {
// few easy cases // few easy cases
if (size <= 1) return; if (size <= 1)
return;
int index = 0; // initialize some variables. int index = 0; // initialize some variables.
while (index < size) { while (index < size) {
@ -58,7 +60,8 @@ void gnomeSort(T *arr, int size) {
template <typename T, size_t size> template <typename T, size_t size>
std::array<T, size> gnomeSort(std::array<T, size> arr) { std::array<T, size> gnomeSort(std::array<T, size> arr) {
// few easy cases // few easy cases
if (size <= 1) return; if (size <= 1)
return;
int index = 1; // initialize loop index int index = 1; // initialize loop index
while (index < size) { while (index < size) {
@ -80,17 +83,23 @@ std::array<T, size> gnomeSort(std::array<T, size> arr) {
static void test() { static void test() {
// Example 1. Creating array of int, // Example 1. Creating array of int,
std::cout << "Test 1 - as a C-array..."; std::cout << "Test 1 - as a C-array...";
int size = 6; const int size = 6;
std::array<int, size> arr = {-22, 100, 150, 35, -10, 99}; std::array<int, size> arr = {-22, 100, 150, 35, -10, 99};
sorting::gnomeSort(arr.data, size); sorting::gnomeSort(arr.data(),
size); // pass array data as a C-style array pointer
assert(std::is_sorted(std::begin(arr), std::end(arr)));
std::cout << " Passed\n";
// for (int i = 0; i < size; i++) std::cout << arr[i] << " "; // for (int i = 0; i < size; i++) std::cout << arr[i] << " ";
std::cout << std::endl;
std::cout << "\n" << std::endl;
// Example 2. Creating array of doubles. // Example 2. Creating array of doubles.
std::cout << "Test 2 - as a std::array...";
std::array<double, size> double_arr = {-100.2, 10.2, 20.0, 9.0, 7.5, 7.2}; std::array<double, size> double_arr = {-100.2, 10.2, 20.0, 9.0, 7.5, 7.2};
std::array<double, size> sorted_arr = sorting::gnomeSort(double_arr); std::array<double, size> sorted_arr = sorting::gnomeSort(double_arr);
assert(std::is_sorted(std::begin(sorted_arr), std::end(sorted_arr)));
std::cout << " Passed\n";
for (int i = 0; i < size; i++) std::cout << double_arr[i] << " "; for (int i = 0; i < size; i++) std::cout << double_arr[i] << " ";
std::cout << std::endl;
} }
/** /**