-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathheapsort.cpp
More file actions
60 lines (50 loc) · 1.8 KB
/
Copy pathheapsort.cpp
File metadata and controls
60 lines (50 loc) · 1.8 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
/*
* Copyright (C) 2024 Jimmy Aguilar Mena
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <utils.h>
#include <argparser.hpp>
#include <iostream>
#include <random>
#include "heapsort.hpp"
int main(int argc, char **argv)
{
argparser::init(argc, argv);
const size_t size = argparser::cl<int>("array_size");
const size_t printlimit = argparser::cl<int>("print_limit",512); // Limit to print the vectors
std::vector<int> v(size);
std::iota(v.begin(), v.end(), 1);
std::shuffle(v.begin(), v.end(), std::mt19937{std::random_device{}()});
if (size <= printlimit)
std::cout << "Intial:\n" << v << std::endl;
std::vector<int> stl = v;
std::sort(stl.begin(), stl.end());
if (size <= printlimit)
std::cout << "stl:\n" << stl << std::endl;
myassert(std::is_sorted(stl.begin(), stl.end()))
std::vector<int> basic = v;
my::heapSort(basic);
if (size <= printlimit)
std::cout << "Basic:\n" << basic << std::endl;
myassert(std::is_sorted(basic.begin(), basic.end()));
myassert(basic == stl);
std::vector<int> floyd = v;
my::heapSortFloyd(floyd);
if (size <= printlimit)
std::cout << "Floyd:\n" << floyd << std::endl;
myassert(std::is_sorted(floyd.begin(), floyd.end()));
myassert(floyd == stl);
return 0;
}