diff --git a/d3/d4c/quick__sort__3_8cpp.html b/d3/d4c/quick__sort__3_8cpp.html index c37cc61d9..cb7214d88 100644 --- a/d3/d4c/quick__sort__3_8cpp.html +++ b/d3/d4c/quick__sort__3_8cpp.html @@ -161,12 +161,12 @@ Functions

Driver program for above functions

-
183 {
-
184 std::srand(std::time(nullptr));
-
185 test_int();
-
186 test_double();
-
187 return 0;
-
188}
+
184 {
+
185 std::srand(std::time(nullptr));
+
186 test_int();
+
187 test_double();
+
188 return 0;
+
189}
test_int
static void test_int()
Definition: quick_sort_3.cpp:138
test_double
static void test_double()
Definition: quick_sort_3.cpp:160
std::srand
T srand(T... args)
@@ -215,15 +215,16 @@ Here is the call graph for this function:
169 }
170
171 std::cout << "Test " << num_tests << "\t Array size:" << size << "\t ";
-
172 std::vector<double> sorted = sorting::quicksort(arr, 0, size - 1);
-
173 if (size < 20) {
-
174 std::cout << "\t Sorted Array is:\n\t";
-
175 std::cout << sorted << "\n";
-
176 }
-
177 assert(std::is_sorted(std::begin(sorted), std::end(sorted)));
-
178 std::cout << "\t Passed\n";
-
179 }
-
180}
+
172 std::vector<double> sorted =
+
173 sorting::quicksort(arr, 0, int32_t(size) - 1);
+
174 if (size < 20) {
+
175 std::cout << "\t Sorted Array is:\n\t";
+
176 std::cout << sorted << "\n";
+
177 }
+
178 assert(std::is_sorted(std::begin(sorted), std::end(sorted)));
+
179 std::cout << "\t Passed\n";
+
180 }
+
181}
std::begin
T begin(T... args)
std::end
T end(T... args)
@@ -274,7 +275,7 @@ Here is the call graph for this function:
146 }
147
148 std::cout << "Test " << num_tests << "\t Array size:" << size << "\t ";
-
149 std::vector<int> sorted = sorting::quicksort(arr, 0, size - 1);
+
149 std::vector<int> sorted = sorting::quicksort(arr, 0, int32_t(size) - 1);
150 if (size < 20) {
151 std::cout << "\t Sorted Array is:\n\t";
152 std::cout << sorted << "\n";