HEAP SORT | Sorting Algorithms | DSA | GeeksforGeeks

GFG please use Green color for Thumbnails . It easy for us figure out GFG videos from others😇

Basically bubble sort on a binary tree, which is why you get complexity log n instead of n since you sift up a tree instead of through the entire array

what's worse than a thick accent? the answer is a loud obnoxious backgrounds music.

why the for loop is starting from n/2 -1 ?

I could promote my sort algorithm but the comment will be deleted as always, so I won't 😿

comment

if 4 is greater than 3, why isnt 3 at the bottom?

great animation

very helpful

wow

I thought a max heap was greatest to smallest. Is this not a min heap?

It took me several views to understand. It might be good to emphasize the fact that when you are going to change the top biggest node with the last node from the heap (not the smallest).

Software Elfs!

thank you

understood how heap algo works clearly..thanks Arjun Tyagi and GFG

Really hating the white on bright green.

Great in 2 minutes it's GREAT VIDEO !!!!

Thanks for these shorts it helps us build up basics in mind or whenever we have to just revise our concepts

Thanks!

😭😭😭😭thank you so much you never disappoint

Bubble Sort
Selection Sort
Insertion Sort
Quick Sort
Merge Sort
Shell Sort

import java.util.Random;

public class HeapSort {

public void Heapsort(int A[]) {
BuildHeap(A);

for (int i = A.length - 1; i > 0; i--) {

int temp = A[0];
A[0] = A[i];
A[i] = temp;

Heapify(A, i, 0);
}
}

public void BuildHeap(int[] A) {
int heapsize = A.length;

for (int i = heapsize / 2 - 1; i >= 0; i--)
Heapify(A, heapsize, i);
}

void Heapify(int arr[], int heapsize, int i) {
int largest = i;
int l = 2 * i + 1;
int r = 2 * i + 2;

if (l < heapsize && arr[l] > arr[largest])
largest = l;

if (r < heapsize && arr[r] > arr[largest])
largest = r;

if (largest != i) {
int swap = arr[i];
arr[i] = arr[largest];
arr[largest] = swap;

Heapify(arr, heapsize, largest);
}
}

public void printArray(int arr[]) {
int n = arr.length;
for (int i = 0; i < n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
}

public static void main(String args[]) {
int A[]= new int[20];

HeapSort hs = new HeapSort();
Random ran = new Random();

for (int i = 0; i < 20; i++) {
A[i] = ran.nextInt(100);
}

System.out.println("Before sorted Array A");
hs.printArray(A);

hs.Heapsort(A);

System.out.println("After sorted Array A");
hs.printArray(A);
}
}
Here is a java code with 20 random variables

To the point video! Good job!

I am just amazed that once in history, somebody, somehow had a time and energy to think about this HeapSort algorithm. I appreciate it though. It's brilliant.

Always a great intuitive video. Well done! However I'm actually asking myself wether or not in 2022 knowing the internals of heapsort (as a software developer) would benefit me. I know costs, and where to apply it. It seems to me like knowledge simply for its own sake.

❤

if anyone here still studying at school let me advice you something don't forget those or you need to come here again to learn again for job interview exams

What is the name of the song?

I am adding in a comment to let you know that I appreciate your love of spreading ease around the world, too. Thank you so much from the depth of heart!!!!!!!!!

I understood clearly after watching 5times thanks....

I was really confused on wether or not you could do the heapsort from the top to the bottom, or it was necessary to do it from bottom level to top, since the first method would increase number of operations, but I look at your video, where you basically do them both.

Thank you so much for this video, i finnaly understood it !!!! I've been reading so many definitions of what heapsort is, and I couldn't wrap my head around it, now it finally makes sense :D

Maximum volume by various surface area
Like triangle🔺 🔲squares rectangle rhombus etc

What if there are 6 or more indexes. How to do?

For min heap sort also can you please upload a vedio :)

Interesting! Understood it, but seems like hell to implement in code...

Great! Thank you

Why not use a min heap? In this way you don't even need to swap the first and the last

Maza aa gya

Best ever illustrated

No nuisance only concept best vdo💪

Online Bookstore

Well explained!

it is so complicated

bootom-up heapsort?

if both child nodes are greater than the parent node,which of the two should swapped to make a max heap?

What do you use to produce these videos? I am a tutor and would like to produce instructional videos for my students.