30 lines
838 B
C++
30 lines
838 B
C++
#include <array>
|
|
#include <iostream>
|
|
|
|
#include "data_structures/heap.hpp"
|
|
#include "algorithms/sort_heap.hpp"
|
|
|
|
int main() {
|
|
std::array<int, 10> a1 = {73, 6, 57, 88, 60, 42, 83, 72, 48, 85};
|
|
dlos::Heap<int, a1.size()> h = dlos::Heap<int, a1.size()>(a1);
|
|
h.maxHeap();
|
|
dlos::heapsort(h);
|
|
|
|
for (int i = 0; i < a1.size(); i++) {
|
|
if (i == 0) std::cout << "sorted: ";
|
|
std::cout << h.getValueAt(i) << ", ";
|
|
if (i == a1.size() - 1) std::cout << std::endl;
|
|
}
|
|
|
|
std::array<int, 20> a2 = {98, 8, 108, 91, 139, 49, 181, 212, 77, 85, 73, 6, 57, 88, 60, 42, 83, 72, 48, 85};
|
|
dlos::heapsort(a2);
|
|
|
|
for (int i = 0; i < a2.size(); i++) {
|
|
if (i == 0) std::cout << "sorted: ";
|
|
std::cout << a2[i] << ", ";
|
|
if (i == a2.size() - 1) std::cout << std::endl;
|
|
}
|
|
|
|
return 0;
|
|
}
|