OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

variable x is unused (#698)

Browse Source 
* variable x is unused

* Use std::endl and a blank line between functions

Co-authored-by: Christian Clauss <cclauss@me.com>
This commit is contained in:
Eric Curtin 2020-01-04 08:33:56 +00:00 committed by Christian Clauss
parent 3c43f7c0e6
commit 98143d9e36
1 changed files with 6 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
sorting/heap_sort.cpp
View File

@ -17,6 +17,7 @@ void max_heapify(int *a, int i, int n) {
a[j / 2] = temp;
return;
}
void heapsort(int *a, int n) {
int i, temp;
for (i = n; i >= 2; i--) {
@ -26,26 +27,28 @@ void heapsort(int *a, int n) {
max_heapify(a, 1, i - 1);
}
}
void build_maxheap(int *a, int n) {
int i;
for (i = n / 2; i >= 1; i--) {
max_heapify(a, i, n);
}
}
int main() {
int n, i, x;
int n, i;
std::cout << "Enter number of elements of array\n";
std::cin >> n;
int a[20];
for (i = 1; i <= n; i++) {
std::cout << "Enter Element " << (i) << endl;
std::cout << "Enter Element " << (i) << std::endl;
std::cin >> a[i];
}
build_maxheap(a, n);
heapsort(a, n);
std::cout << "Sorted Output\n";
for (i = 1; i <= n; i++) {
std::cout << a[i] << endl;
std::cout << a[i] << std::endl;
}
std::getchar();
}