Awesome!

So add the numbers and then swap them until highest number at top?

wow thank you for this

Come back zooce dude btw how are you

Very helpful man. Thanks a lot.

I am looking for decision tree using quick sort algorithm, any clue?

Thank you best heapify explanation i saw !!🦾

Visually I see the last swap between 5 and 37. but programmatically how to detect the disorder after looping all node index?

I can't imagine this is a video from 10 years ago and I am surprised that it didn’t get the rich.Wow!!Very rare video of dfs in directed graph

Thank u so much it helps a lot 💗

You’re out of this world

3:45 why do we swap 97 and 1 instead of 97 and 12? Even overall I can't see any benefits over using a binary tree.

Thank you, finally a good video on dfs timestamps.

-25n <= -25n^2 cannot be true for natural numbers n btw

this is really helpful, thank you!

great explanation

i owe you my entire life

10 years later this is still really helpful!

At the end you are not adding the cost of leaves

Why you have stopped making such a quality videos??

thanks bro

saved my day bro

wish that someone explained like this in the lecture

kteer btna3es kes emak

Thanks

KZbin AWARDS GOES TO..

Thank you so much! I finally understand how we get that table(or two matrix) step by step! This is the best explanation I found!

That's a pretty stupid algorithm, unless you have very unusual memory constraints.

does insertion of nodes always be in red initially?

Can someone explain to me why after each instruction you add 4 to the program counter. Asuming you have an 8 bit rom, getting a 32 bit instruction field would require you to cycle through 4 adresses to begin with. What's the point to adding 4 after that ? Is there a secret two bit counter somewhere that's not displayed and this is just an over simplification ?

Watched at x2 and it immediately brought the algorithm back. Clearly you're amazing at presenting information. Thanks, mate!

Finally i found someone who is not from india

For those wondering how this algorithm works as it stops in the middle, you need to write a condition to check if maxHeap property is applied for the whole list everytime and repeat the process of heapify if it fails, here is an example import java.util.Arrays; public class MyClass { static boolean maxHeapFormed = false; public static void main(String args[]) { int[] nums = {5,12,64,1,37,90,91,97}; while(maxHeapFormed == false){ maxHeapify(nums); checkMaxHeap(nums); } System.out.println(Arrays.toString(nums)); } public static void checkMaxHeap(int[] nums){ int leftChild; int rightChild; for(int i = nums.length/2;i>=0;i--){ leftChild = 2*i+1; rightChild = 2*i+2; if(leftChild < nums.length && nums[leftChild] > nums[i]) return; else if(rightChild < nums.length && nums[rightChild] > nums[i]) return; } maxHeapFormed = true; } public static void maxHeapify(int[] nums){ int length = nums.length; for(int i = nums.length/2;i>=0;i--){ heapify(nums,i); } } public static void heapify(int[] nums, int i){ int maxValue = i; int leftChild = 2*i+1; int rightChild = 2*i+2; if(leftChild < nums.length && nums[leftChild] > nums[maxValue]) maxValue = leftChild; if(rightChild < nums.length && nums[rightChild] > nums[maxValue]) maxValue = rightChild; if(maxValue != i) swap(nums,maxValue,i); } public static void swap(int[] nums,int highest, int i){ int temp = nums[highest]; nums[highest] = nums[i]; nums[i] = temp; } }

Thanks!

Your explanation is very easy to understand

fantastic video!

thank you mister

ngl this made no sense. How did you have that graph already made? shouldnt you be making it as you go?

thanks ;)

I have to submit an assignment tomorrow but I also have an exam on the same day. I need help

8 years ago and his mic sound better than mine

Who knew Ben Shapiro would be teaching me Data Structures lol Great Video btw

thank you my savior

I enjoyed the part where you sniffed and smacked your lips. Oh wait, that was the entire video

What about min heap?

Where are you now zooce

right? right? right? right? so insufferable.

This is absolutely amazing video with very much on-point run of DFS with pre and post numbers for the algorithm. Thank You!

at 5:10, after i=1, your algorithm stops according to the code (for i=1 to 1). You have not explained how did you found out that the LEFT child of index i=1 does not align with the max_heap rules. You did it via visual inspection instead :(

isn't there a way to gather the indexes of the subsequence while iterating through the array ?