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

formatting source-code for e464ddac36

Browse Source
This commit is contained in:
github-actions 2020-06-20 18:34:51 +00:00
parent e464ddac36
commit 97bf410b36
1 changed files with 25 additions and 27 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
sorting/heap_sort.cpp
View File

@ -33,9 +33,8 @@
* @param sz size of array
*
*/
auto printArray = [] (int *arr, int sz) {
for (int i = 0 ; i < sz ; i++)
std::cout << arr[i] <<" ";
auto printArray = [](int *arr, int sz) {
for (int i = 0; i < sz; i++) std::cout << arr[i] << " ";
std::cout << "\n";
};
@ -48,10 +47,10 @@ auto printArray = [] (int *arr, int sz) {
* @param arr array be to sorted
* @param
*/
void(*heapify)(int *arr, int n, int i) = [] (int *arr, int n, int i) {
void (*heapify)(int *arr, int n, int i) = [](int *arr, int n, int i) {
int largest = i;
int l = 2*i + 1;
int r = 2*i + 2;
int l = 2 * i + 1;
int r = 2 * i + 2;
if (l < n && arr[l] > arr[largest])
largest = l;
@ -73,11 +72,10 @@ void(*heapify)(int *arr, int n, int i) = [] (int *arr, int n, int i) {
* @param n size of array
*
*/
auto heapSort = [] (int *arr, int n) {
for (int i = n-1 ; i >= 0; i--)
heapify(arr, n, i);
auto heapSort = [](int *arr, int n) {
for (int i = n - 1; i >= 0; i--) heapify(arr, n, i);
for (int i = n-1 ; i >= 0; i--) {
for (int i = n - 1; i >= 0; i--) {
std::swap(arr[0], arr[i]);
heapify(arr, i, 0);
}