Hey Nick. Great content. Although heapify can be made much more efficient. remember leaf nodes don't need to be headpified. so if i>size/2 simply return for heapify method !
Hello, this was very helpful to understand binary heaps. I was wondering if you need the capacity. Can you just make a min heap without a capacity and what is the point of having a capacity?
can I know of the name of the blackboard software you are using? I am searching a blackboard like that for awhile. The info would be really helpful to me.
@@CoffeeBeforeArch i used this implementation to solve this problem: practice.geeksforgeeks.org/problems/kth-smallest-element/0 Here is my code, but when i submit i get Segmentation Fault (SIGSEGV) runtime error. Here is my code: drive.google.com/file/d/1uLXrf81ZxRABxj8y3PcPa4szIdFPjWoI/view?usp=sharing If you could take a look, it would be very helpful, thanks in advance!
![“อ.เบียร์ คนตื่นธรรม” มาตามคำเรียกร้อง แหกศาสตร์ฮวงจุ้ย เตือนสติอย่างมงาย | แฉ 7 พ.ย. 67 [1/3]](http://i.ytimg.com/vi/5fc4S3xBNfc/mqdefault.jpg)
Great Video! Helped me understand this data structure much better. Keep up the great work!
Thanks! Glad you enjoyed it!
actually the indexing start with 1 , and the zero position we put garage to maintain the rules
l=2*i
r=2*i+1
p=i/2 ,and that all the books definitions
Hey Nick. Great content. Although heapify can be made much more efficient. remember leaf nodes don't need to be headpified. so if i>size/2 simply return for heapify method !
Obviously....But he wants to keep it as simple as possible. I see you r a brilliant programmer but u don't have to prove that here.
This was very helpful, thank you
Chris Thomas no problem! Happy to help!
clear and to the point.Thanks:)
Happy to help!
Hello, this was very helpful to understand binary heaps. I was wondering if you need the capacity. Can you just make a min heap without a capacity and what is the point of having a capacity?
why is the end working? You don't use the int min again. In my programm after i extrect the min element the heap don't print again
Brilliant explanation....love it bro!!!!!....keep on making such videos plzzzzz..
Super helpful thank you!
Zacree Carroll happy to help!
amazing video! you helped me a lot with my studies :)
Hi I loved this content, if you have time could you possibly cover some more algorithms? Such as topsort, bellman-ford, kruskal's, prim's
can I know of the name of the blackboard software you are using? I am searching a blackboard like that for awhile. The info would be really helpful to me.
Xournal
great video man! 🔥👍
Glad you thought so!
@@CoffeeBeforeArch i used this implementation to solve this problem:
practice.geeksforgeeks.org/problems/kth-smallest-element/0
Here is my code, but when i submit i get Segmentation Fault (SIGSEGV) runtime error. Here is my code:
drive.google.com/file/d/1uLXrf81ZxRABxj8y3PcPa4szIdFPjWoI/view?usp=sharing
If you could take a look, it would be very helpful, thanks in advance!
Hi, this video was awesome, it makes lots of help to me. Thank you :)
Happy to help!
why does this have so less views ?
awesome :)