(
inti = 1; i < n; i++) {
55 while(j >= 0 && temp < arr[j]) {
71 size_tn = arr->size();
73 for(
size_ti = 1; i < n; i++) {
76 while(j >= 0 && temp < arr->at(j)) {
77arr->at(j + 1) = arr->at(j);
80arr->at(j + 1) = temp;
96 doubler = (std::rand() % 10000 - 5000) / 100.f;
97arr[N] =
static_cast<T
>(r);
106 intarr1[10] = {78, 34, 35, 6, 34, 56, 3, 56, 2, 4};
107std::cout <<
"Test 1... ";
109assert(std::is_sorted(arr1, arr1 + 10));
110std::cout <<
"passed"<< std::endl;
112 intarr2[5] = {5, -3, 7, -2, 1};
113std::cout <<
"Test 2... ";
115assert(std::is_sorted(arr2, arr2 + 5));
116std::cout <<
"passed"<< std::endl;
118 floatarr3[5] = {5.6, -3.1, -3.0, -2.1, 1.8};
119std::cout <<
"Test 3... ";
121assert(std::is_sorted(arr3, arr3 + 5));
122std::cout <<
"passed"<< std::endl;
124std::vector<float> arr4({5.6, -3.1, -3.0, -2.1, 1.8});
125std::cout <<
"Test 4... ";
127assert(std::is_sorted(std::begin(arr4), std::end(arr4)));
128std::cout <<
"passed"<< std::endl;
131std::cout <<
"Test 5... ";
134assert(std::is_sorted(arr5, arr5 + 50));
135std::cout <<
"passed"<< std::endl;
138std::cout <<
"Test 6... ";
141assert(std::is_sorted(arr6, arr6 + 50));
142std::cout <<
"passed"<< std::endl;
static void tests()
self test implementation
static void create_random_array(T *arr, int N)
Helper function to create a random array.
int main()
Main function.
void insertionSort(T *arr, int n)
Insertion Sort Function.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4