2.6.3 Heap - Heap Sort - Heapify - Priority Queues
ฝัง
- เผยแพร่เมื่อ 8 มิ.ย. 2024
- PATREON : www.patreon.com/bePatron?u=20...
Courses on Udemy
================
Java Programming
www.udemy.com/course/java-se-...
Data Structures using C and C++
www.udemy.com/course/datastru...
C++ Programming
www.udemy.com/course/cpp-deep...
Topics Covered
1. Array Representation of Binary Tree
2. Complete Binary Tree
3. Heap
4. Heap Sort
5. Heapify
6. Priority Queue
![[Live] : ONE 167 วันนี้!! "ตะวันฉาย vs โจ"](http://i.ytimg.com/vi/D9_dvfIa6Ao/mqdefault.jpg)
So basically we're all going to university to get our degree but we learn all the stuff from youtube tutorials.
Duuuude . This is like the harsh truth. I would have given up long ago without these Online Teachers.
So truuuu......!!!
Prince Desperado so true 😂
Prince Desperado yeah
Very true sadly!
2:34 - Representation of a Binary Tree using Array
14:15 - Heap ( Max & Min )
16:21 - Insert in Heap (Max)
22:18 - Delete in a Heap (Max)
30:12 - Heapsort
41:37 - Heapify
47:00 - Priority Queues
👍
Nice
You are doing a real good deed man
Thanks man
not all heroes wear capes
As someone who has failed data structures twice, I owe this semester's success to you. Not only this, but all of your videos have helped me more than you could ever imagine. Thank you so much; you are a God send for all struggling CS students out there!
3 year old video and he still likes the comments. Absolute mad lad :D
th-cam.com/video/9mXD82-CUEs/w-d-xo.html
@@gytiskau1865 th-cam.com/video/9mXD82-CUEs/w-d-xo.html
Using a syllabus to judge difficulty is like reading the ingredients to a Michelin Star meal and assuming it's easy to prepare since it uses simple ingredients. Preparation and execution are two different things.
Switching topics, the class was taught by a professor with the lowest ratings in the school. Resources were seldom provided, ambiguous project/homework requirements, no feedback on work, very unforgiving grader, etc. The way a class is taught is a major factor in determining whether you pass or not.
It's good that you're looking into these videos in advance which will provide you with a sort of insurance if you get a professor like I did (twice).
@@Abdullah-ak231
@@Abdullah-ak231damn bro you're so smart but who asked?
30:30 That jaw dropping moment!! Never thought that heap sort could be explained so elegantly. Great work sir!
Exactly my thoughts
Yeah but exactly at that time after deleting 30 array representation was wrong... It should. be 20 16 8 15 10 right ? Do you know at 30:00 how he swapped 8 and 10? Little bit confused
@@belalr2198 Ur right, 8 and 10 should not be swapped. He mistook 10 as the child of 8 and swapped them.
@@gautamvarmak8207 Yes he mistook and did it erong. I didn't even notice this cuz I solved it on my own and didn't even matched with his result. After reading this comment I found that there was some error on his side. No biggie.
I was like "DAMN I DIDN'T EXPECT THAT COMING"
I'm a mostly-self taught developer that started a Computer Science masters and found my foundations lacking. It's been a stressful semester, but your TH-cam materials have been the absolute most effective means for me to remediate my algorithm and data structures deficiencies. I just purchased both of your courses. I hope to be able to work on them over the summer, but even if I don't, I wanted to purchase your content to express my gratitude for the excellent free content you provide here on TH-cam. I'll be suggesting your materials to my friends that are learning to code and trying to self-teach algorithms and data structures. Way too many courses focus on flash and polish on their videos at the expense of content. Your videos are great because they focus on content and give us plenty of examples. 🙇♂️🙇♂️🙇♂️🙌🙌👏👏
I have taken his classroom course. Everyone in the class was a fan of Abdul Sir. We have so much respect for him.
Sir I'm a beginner in c programming can u provide a list of basic programs??
@@naveenchowdary7959 thanks sir
@Mahendra Singh Udemy Abdul Bari
@Mahendra Singh you will find links in description
At 22nd minutes and I paused to come, check the comments because I feel lots of happiness and I was sure many people would be feeling the same. Looking at the comments I was right. This guy is great. Shout out from Kenya
i've done the same lol
Bro you feel me!
i did the same at 30 minute mark!
He is the best teacher !!
For me it was 31st minute :)
What a beautiful and smooth transition from deletion of an element from heap to sorting the heap.
Pausing at 30:42 and taking a time to appreciate the simplicity of this video. It is an absolute gem and the way he taught Heap-sort was brilliant.
yea I paused too
@@ninjaa9087 That is exactly what I am doing, the transition to heap sort was so smooth!
You got me 😳😳
Same!!
It was just a chef's kiss right there
The 50 people who disliked are University teachers who are probably jealous 🤣🤠
Because their not getting paid
Arafat Khan lol yes
Which University?
😂😂😂😂👍
@@jaigupta285 whats app university ...and my proffesor is literally from there so i came here
Missing u alot ... you're the person who taught Algorithms in a very soft way .... great man... stay blessed 🤲 Allah bless u ...
what do you mean by missing him ? is he fine ?
Why u say that missing him ? He is fine ??
Why are you telling so ??..is he fine???
@@rajopriyochanda8316 Yes, he is fine! ALHUMDULILLAAH
Greatest achievement of a teacher is not to teach a student but to make a student curious and interested so that he can pursue on its own. You are one of the greatest teacher i have come across Abdul Sir. If learning from your YT videos can be so much interesting then i wonder how will it be to learn in-person from you.
Wow, thank you
th-cam.com/video/9mXD82-CUEs/w-d-xo.html
40:52 "copy everything from the board or (moves away from the frame) take a snapshot" that's what an awesome teacher is. Always knows what the students need.
30:50 best part.. how he subtly moved into the concept of heap sort leaving no doubt in mind. Excellent teaching.
couldn't agree more with this!
Same♥️♥️♥️♥️
th-cam.com/video/UgFNam-Ghpk/w-d-xo.html
#Respect.. 50 mins went so interesting like a movie :)
Abdul Sir, I have been working professional for 10 years now but never have I ever been so comfortable with Heaps. Thank you for making it so easy and clear for us.
2:04
I can tell you exactly what kind of content you will get after purchasing this course. I purchased the java, DS courses e 2 months ago. The courses are fabulous and the concepts are covered in great detail. Not just for exams or interviews but the knowledge provided is also superb
Don't think twice before purchasing this course. I got a lifetime validity on this one.
31:33 - I am pausing to appreciate the effort!
Thank you very much again. The clarity in simplicity is awesome. In my decade of software development engineer career I have found very few as this great explanation of the core computer science topic. Looking forward to complete the playlist.
@@abdul_bari I am from Kathmandu, Nepal. I completed by Bachelor's Degree in Information Management from Tribhuvan University, 2009, Kathmandu, Nepal.
And I am near about completing the playlist :)
I think the next step or the future videos I would love to see would be on ML and it's related mathematics because this topic is becoming very much popular and I find the usage becoming relevant to many people from various backgrounds.
Thank you very much for the great effort in making such wonderful tutorials for people like me who is always looking forward to improve and learn.
I look forward to your future videos.
@@AnitShrestha so after a decade what made you revisit?
@@jackfrost8969 When ever I learn new languages or re-cap on the ones that I have used before, I do it by learning: data structures and algorithms. Doing this helps to get more insights about the usage of the language and adds more problem solving skills with that language. I am not an expert, just some one who learn new things and revisit to basics always adds depth and as well as different perspective as a software engineer. Thanks.
The apple pilling in the grocery store with the heap lectures where the best example given so far, smart!
There is a small mistake at 29:41, when deleting 30 from the heap, 8 is swapped to the root. it should compare 16 and 20 to 8, and use 20 as the new root, thus 20 and 8 is swapping place. No further swaps are needed, resulting in heap in state 20, 16, 8, 15, 10.
Yes, that seems to be true.
yeah good spot
Anyhow, don't we need to compare 8 and its child 10? which is ultimately 20,16,10,15,8
yes
@@KarthikRamurg Negative on the comparison. The children of 16 is 15 and 10. The children of 8 is NULL and NULL. When comparing children to parent (i) the index is left (2i) and right (2i+1). In the video he compared index 3 with index 5. When actually index 3 can only be compared with either indexes 6 & 7. However, those nodes were deleted and replaced with previous maxes( index 6 of value 30) and (index 7 of value 50). The next deletion of 20 would render the tree to be 16, 15, 8, 10. Where indexes 5, 6, & 7 are holding previous max values of 20, 30, & 50.
Your tutorials have demystified data structures for me. When I was in college taking these courses, it was overwhelming and confusing. But, the way that you break it down makes so much sense and it actually makes it enjoyable!
I've been a CS teacher, and I applaud your use of multiple diagrams to show the step-by-step results. Well done!
Thank you for all the efforts! you guys are an unsung heroes!
Just want to point out how much work goes into making videos like these - first he has learned and mastered the material better than most instructors I have ever met. That takes decades.
Then material and examples must be prepared. Video has to be recorded and edited. If a video is one hour, easily it can take 4-5 times longer to make it. Thank you for these incredible videos. You dive in and cover the content in a way that makes it "click"!
This is amazing. You have such a calm and slow way of teaching and it makes me very relaxed, but also knowledgeable. Thank you!
That apple example was the key for me. After that, I felt like everything was put in place in my brain. I can't forget about Heaps now! Thank you Abdul. Much love from Uruguay.
U saved me sir from failing in this subject. Thanks a lot sir..
This man just looks like he loves imparting KNOWLEDGE!
I can literally watch your vdos for a day straight and pass my entire sem
I rarely leave a comment on youtube but the quality of your teaching is so good that i had to leave a comment for you. Sir, the way that you explained heapsort and its intuition made me smile. The mark of an exceptional teacher in my eye is one who teaches in a way that makes a concept obvious to a student. Thank you so much sir! this was an incredible lecture
Awesome explanations sir, I never felt confused at any single point in time in this complete lecture. Thanks a lot.
One hour long lectures are very monotonous and hard to follow but this was not. Excellent content sir :)
It's the third youtube tutorial of yours that I watch, I just bought your c++ course and I adore your work so much! You are such a talented teacher!
Abdul Bari sir proved that "Simplicity beats complexity"..
I see where he would have struggled during his graduation, hence he is emphasizing there with a little stressing voice in the video to make you note on certain points. Myth resolver!!
In heapify at last he did two iteration. Two is the size of tree here. So if number of elements are n we have to do log(n) iteration (Depends on case). So, going through each node will take n time and heapify will take logn time. Therefore time complexity should be O(nlogn) for heapify. Isnt it????
Hello Abdulji! You lectures are crystal clear! None of the other instructors on youtube can match your capability of teaching! Everything you teach makes so much sense! BIG THANK YOU!
Abdul Bari sir , mycodeschool , saurabh shukla sir are legends for students of CS :)
Will be thankful of u forever. A teacher's knowledge will be with us forever.
chilla chilla ke sab ko sceme bata de...
@@ANAS-ex3ru nahi bhai koi is scheeme me nahi jaega unko ytber wale bhaiya ki journey dekhne me jyada interest hai naa ki actual coding krne se.
You are an incredible teacher, Abdul Sir. You teach every topic in such a simple way. Thank you for making these videos. It is an honor learning from you.
You are a hero sir! To every Compurter Science Students. Every single concept of Heap explained so properly and with great details! No other teachers could have gone to such lengths as you! I really wish you the best of health and best of everything!
Yay! Heaps are my favorite. 😁 I am glad you are back on TH-cam again sir!
The most amazing explanation of Heap I’ve ever seen. Made a difficult topic feel like a walk in a park.
Thank you for posting this level of amazing contents free for all.
(Purchased your DS&A course on Udemy now).
Thank you.
th-cam.com/video/UgFNam-Ghpk/w-d-xo.html
Sir if I ever meet you personally, I would give you a standing ovation
Such a talented and understandable teacher..To the point and and actually have such a great teaching technique..Million times of respect for you sir
You have a natural talent when it comes to teaching!! Awesome explanation, one go through your video and one can never forget the concept. Thank you
Bless you, I got through my Data Structures class because of your amazing tutorials!
Best teacher ever! I can't imagine how I struggled to understand heaps, but after landing here..man! I must say I grasped everything.
I really feel the lack of exact words to express my gratitude towards you sir , every second of yr video is worth watching , its like you go inside the students mind , see their level of understanding & then teach it the way students can get the whole concept behind it , thank you so soo much Sir , you're great!!
Wow, what a way to explain. Definately mi favorite algorithms teacher. Greets from México
i would have cleared my algorithms paper with A+ if i found you in 2002.
I appreciate ur desire for learning even after so long ....!!!
bro job karte karte kyu dekh raha hai, i thought concepts of dsa arent used when you join as a developer
@@jay-rathod-01 did he tell you that he got a job?
I was genuinely sitting in my algo class so lost and depressed thinking I am stupid for not understanding heaps, but you explained it so articulately and clearly, I can't believe it's that simple! Amazing work!
Creating a Heap is inserting all the elements of a given array into an existing heap assuming the first element of the given array as the initial heap, where as Heapify is simply creating a CBT ( complete binary tree) with all the elements of the given array and then converting that CBT into a heap, by moving up from the last non-leaf node up to the root. Great explanation as ever.
You are amazing! You teach so clearly and make me see the gaps in my knowledge. Thank you, Professor Bari!
Mann, you are the best teacher I have ever come across. Kudos..!
You are an amazing teacher! Every time I watch one of your videos, I get mind blown by how everything makes sense. Thanks so much, you are the reason I understand Algorithms
such a great explanation... nothing beats experience.. no animation or anything beats a traditional teaching style by an experienced personnel
Sir, ur video just got an Ad from Game of Thrones and watched it full. My exam is tomorrow and u r the savior.
He is giving the toughest concepts just like doing everyday conversation with a friend. My GOD! I am scoring an A tomorrow and I dedicate that to you. May Allah gives you all the success and fame which is inevitable for you! :)
LOVED IT. SO CRISP AND CLEAR. LOVED THE ENERGY, THE SPEED AND CONCISENESS!!!!!!
This is one of the best explanations of a heap sort. Amazingly put in laymans terms to explain the magic is hidden between creating a maxheap through insertion and maintain the maxheap while deleting.
I clapped my hands at the end of this video. Beautifully explained with great details. Hats off to you Sir.
th-cam.com/video/UgFNam-Ghpk/w-d-xo.html
You're an incredible professor with a lot of knowledge. It is a pleasure to take lectures from you.
I would have to say that this is probably the best video about Heap Sort and its foundation on TH-cam. Thanks, Mr. Bari.
Wow one of the most rewarding 50 mins I've ever spent on TH-cam
Huh , I just took this today in class , it's a good review, thanks mate , and welcome back
Abdul Sir is alone a university for me . I have cracked 2 interviews on the basis of DS , and all its credit goes to sir. Heartly thankyou sir for god level videos/explainations.
Congrats !! Adwani
I have not found someone who explains and simplifies things more than you
, you unique person I love you
Never thought that I will be able to understand Heap sort this easily . I literally smiled when he said that this is only heap sort .
Just one thing to say: Thanks a lot
What a crystal clear explanations Sir !!! Words are less to justice your teaching talent . God Bless you sir .
taught way better than college teacher, thank you
Wow Mr. Bari...
Your first series about complexity were great, but here you clearly supercharged yourself, very very good content.
Natural talent, thank you for sharing your knowledge and amount of time and effort you put in these Algorithm series.
Okay, haha, my favorite part HAS to be 43:40 to 43:44! Wonderful video overall~
But I think that the part between 29:50 - 29:56 is not correct. 10 (in 5th position) is not the child of 8 (at 3rd position) [(3*2 = 6, but that's outside the heap; so 8 actually is a leaf, on the right side of 20)].
(Also at this point, he hasn't yet fixed the 10 on the 2nd position which should really be 16; a minor slip)
Yes , I also noticed that !!
Yes, u r right. I searched the comments that any other also noticed or not. 😊 Thanks
thank god i found someone who noticed..i first thought i was wrong
@@nitishchoudhary201 sahi mai chaudhary bhai dimag khrab hogya tha....mujhe lga kuchh concept rehgya...fir se dekhni pdegi video....
30:29 what a moment sir you are the bestest in teaching this deep concepts easily ,your flow of teaching concept is just remarkable,thank you sir for creating such a wonderful playlist.
The best teacher ever. I have never been able to understand the definitions of Full and Complete Binary Trees this clearly.
I saw this video the night before an interview. Learnt what a was heap for the first time. I am lucky so I got heap question and I implemented for the first time in the interview. I owe this man the internship I got
Sir...You are "One And Only".. You're Great Sir!!!!☺
I was gonna buy your course today, but it’s at $99. I will have to save a bit first, but I know it will be worth it because you’re the only person that can make me understand this stuff.
Hands down the best video on heaps on TH-cam. Thank you for your time and detailed descriptions.
You are a literal God. I mean, I have seen way too many youtube lecturers here but you seem to have this gravity and simplicity which still remains unparalleled. Thank you for your efforts! Genuinely wish to meet you some day. :)
Let’s appreciate the way as he taught Us DSA , in my clg i also watched his videos only, thank you so much sir for providing these easy way of explanation.❤🙏🏻
th-cam.com/video/9mXD82-CUEs/w-d-xo.html
I am amazed how effortlessly you explain concepts. hands down! one of the best series on algo.
Sir You are rare gem on youtube may allah grant you jannah and bless you with his blessings .
Jazak Allah hu Khaira❤
You are the most amazing teacher on TH-cam. Best teacher. I never liked heaps before I saw your tutorial. Now it is my favourite sorting method!!
24:40 Mind blowing. I always wondered why the last node is placed at the top after deletion.. now I got the answer.
Sir..We the Bangladeshi student's are very much grateful to you.Even teachers from our universitie's suggest your algo videos .But one thing to mention!! Please don't stop making videos on algorithms and data structures.Please include more and more advance algorithm in your playlist.I discovered myself and my friends viewing your videos even before the very last moment of exams.May Allah bless you..
You are a phenomenal teacher. Kudos to you, sir. What manifests as hours of confusing lectures in my college, you manage to make simple, engaging, and interesting in a fraction of the time. Thank you.
cannot express my gratitude. Thank you Mr Abdul - all of your videos are priceless! you're a legend. Thank you for helping to improve
Thankyou sir for coming back to TH-cam 🔥 we badly missed you 💓💓💓
Brilliant lesson just in time! Now i can bravely do a lab on Algorithms and Data Structures about heaps and it not the first time your channel helps me in studies! Thank you a lot!
Mr.Abdul is the best teacher I have ever met!
tyvm
Completely flabbergasted after watching this lecture; unbelievable explanation of the concept of HEAP. The world needs more teacher like Mr. Abdul Bari who can make ambiguous topics so easy to understand. Looking forward to take more of your courses.
You have explained it so well sir...The way you taught was really great and it is easy to understand as well....Thank you so much sir.
Tomorrow is my exam and i m learning it from my favourite teacher and the fun part is that my class teacher has also seen your videos to teach us. He has taken the same examples u taught here of all topics😂😂
The college seems fraud to me
@@nishant1877 😂😂😂😂😂
Best online data structures teacher I've ever seen
You are an amazing teacher I have ever seen in my academic journey. I feel like I am sitting for 5 minutes for your 51 minutes lecture
Why universities are taking so much fees when Bari sir teaches 10000000 times better for free.
Amazing! Especially when heap sort comes from delete a node, I just want to say, oh my god!!!!!!
Was scared when I saw the long list of concepts to be covered but could not stop watching once I started. Thank you Prof. Bari!
The most information packed 50 minutes. Very very well designed, detailed and yet so interesting video. Thanks Abdul. After all finally I understood the heaps :).
Fun fact, creating a heap is actually faster than O(n*log(n)). Why? When you add your first element, quite alright, the process is log(n), but you only have ONE element, so it's really O(1). The next time you do it, it's O(log(n)), but n equals TWO, which is pretty close to O(1), just a bit bigger. Then log(n) but n=3, and so on and so on and so on. So the 'n' isn't fixed, but grows linearly as more elements are added to the heap.
When we say n*log(n), we're making a lazy assumption that all heap creation operations take the same O(log(n)) time, and if you do this n times, you get n*log(n). Makes sense, I guess. But really, we have for the net number of operations: log(1) + log(2) + log(3) + log(4) + ... + log(n-3) + log(n-2) + log(n-1) + log(n) = log(1 * 2 * 3 * ... * (n-1) * n) = log(n!).
Now, you're probably looking at the n factorial and thinking, "omg, there's no way something with an n! in it is smaller than n*log(n) at any computational scale". But our analysis says it has to be. And sure enough, if you plot y = n*log(n) vs. y = log(n!), log(n!) is always smaller, and the difference only becomes more pronounced as n grows. That said, y = log(n!) has the same basic shape as n*log(n), so if you're feeling lazy, you can say n*log(n), it's whatever....
Just thought to share this in case anyone came to the more accurate conclusion of O(log(n!)) and genuinely got confused (as did I), or people that just enjoy little pockets of fun math here and there.
Best wishes :)
- Ozzy Explains 😇👋🏽
yep thats a nice explination!
th-cam.com/video/9mXD82-CUEs/w-d-xo.html
your analysis is also wrong. heapifying actually is just a O(n) operation. it's linear.
You are the new king of TH-cam! How did you just teach me that?! 😎
Amazing explanation. I knew all the concepts before but still watched the video at 1.5x to the end because the explanation is so intuitive and clear.
It seems magical to me that the same contiguous allocation of memory can function as arrays and heaps both with wildly varying time complexities for the same functions. Algorithms and mathematics in general is beautiful :)
Will be donating something to the Patreon link as well to show my support for making education accessible to everyone.
Everyone should give this guy a coffee to show appreciation for his time and energy to make awesome content.
You are the best instructor ever, I wish I found this channel 5 years ago when I was a student.