backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-02-09 13:37:25 +08:00
Code Issues Projects Releases Wiki Activity

fix: quick_sort_3.cpp warning

Browse Source
This commit is contained in:
David Leal
2022-10-02 21:08:55 +00:00
parent 24f68ea4db
commit d95ac02619
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
sorting/quick_sort_3.cpp
View File

@@ -146,7 +146,7 @@ static void test_int() {
} }
std::cout << "Test " << num_tests << "\t Array size:" << size << "\t "; std::cout << "Test " << num_tests << "\t Array size:" << size << "\t ";
std::vector<int> sorted = sorting::quicksort(arr, 0, size - 1); std::vector<int> sorted = sorting::quicksort(arr, 0, int32_t(size) - 1);
if (size < 20) { if (size < 20) {
std::cout << "\t Sorted Array is:\n\t"; std::cout << "\t Sorted Array is:\n\t";
std::cout << sorted << "\n"; std::cout << sorted << "\n";
@@ -169,7 +169,7 @@ static void test_double() {
} }
std::cout << "Test " << num_tests << "\t Array size:" << size << "\t "; std::cout << "Test " << num_tests << "\t Array size:" << size << "\t ";
std::vector<double> sorted = sorting::quicksort(arr, 0, size - 1); std::vector<double> sorted = sorting::quicksort(arr, 0, int32_t(size) - 1);
if (size < 20) { if (size < 20) {
std::cout << "\t Sorted Array is:\n\t"; std::cout << "\t Sorted Array is:\n\t";
std::cout << sorted << "\n"; std::cout << sorted << "\n";