Heaps, heapsort, and priority queues - Inside code

Подписаться 33 тыс.

Просмотров 76 тыс.

50% 1

Source code: gist.github.com/syphh/50adc4e...
🔴 Learn graph theory algorithms: inscod.com/graphalgo
⚙ Learn dynamic programming: inscod.com/dp_course
💡 Learn to solve popular coding interview problems: inscod.com/50problems_course
⌛ Learn time and space complexity analysis: inscod.com/complexity_course
🔁 Learn recursion: inscod.com/recursion_course
NB: This video is ad-free, you can choose to support Inside code by purchasing one of the courses above or dropping a super thanks!
NB2: Discounts of courses above are permanent
I also post content on LinkedIn (inscod.com/linkedin) and Instagram (inscod.com/instagram)

Наука

Опубликовано:

27 авг 2021

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 112

@insidecode Год назад

Discover the new graph theory algorithms course: inscod.com/graphalgo 🔴 / \ 🔵-🔴 | | 🔴-🔵

@varunalur3988 Год назад

This is hands down the best explanation of heaps. You're a very talented person, thanks so much for your efforts. You did in 19 minutes what my professor is incapable of doing in 3 hours.

@KOPLuffy Год назад

Totally agree

@MoscleBrog 5 месяцев назад

Animated example in algorithm. YES PLEASE. This is the best explaination with showing the flow of the program. TY Inside Code

@fredericoamigo 11 дней назад

This video is one of the best I've seen on the topic. Simply brilliant! Keep up the good work!

@josiahdavid7735 2 года назад

Watching the heapsort at 15:25 was so fun! This is a great video. With excellent explanations and visuals, Great Job!

@insidecode 2 года назад

Thanks a lot!

@Sapphiamur 4 месяца назад

Best explanation, seriously, all the graphics were so helpful! Thank you so much!

@BlaBlaBlaInDaHouse Год назад

This is definitively the best video on heaps! Thank you for your effort

@akshaygoel2184 2 года назад

The animations are incredible! I'm amazed at the detail

@MateoAcosta-zi2us Год назад

Incredible way of teaching. Little step by step, beautiful and organized illustrations. Thank you very much :D!

@sweetphilly2 Год назад

Really do appreciate you letting a thought/point/concept breathe before moving on. It gives the listener some time to process without noise (i.e. the presenter talking) before moving along with the lesson 👍

@stasdurka 6 месяцев назад

Great video. I appreciate the work you put in these videos and the fact that you explain the concept very well (it takes real understanding to be able to teach something like this, unlike many channels out there wasting the viewer's time going through some example step by step on a whiteboard). Had to review some old stuff from uni and I'm so glad I found your channel :)

@sharjeel_mazhar 4 дня назад

That's IN SHA ALLAH really made me happy, to see a Muslim man making these great videos with easy and visual explanations! 🔥 Kudos to you 💯 keep doing the hard work, you will reach 1M some day IN SHA ALLAH!

@msinkusmeowmeow1442 Год назад

Awesome explanation! Keep up the good work, continue improving and one day your channel will be huge!

@KateONeillLumpySpaceKate Год назад

inshallah i will pass my exams

@shyngysbek6907 2 месяца назад

By far the best video about Heap-sort algorithm. Thank you!

@azizbenanaya8833 11 месяцев назад

very elegant way of explaining heaps straight to the point simple but efficient keep the great content up 🙌

@elyababakova2125 10 месяцев назад

Very nice summary and illustrations of heap!

@felipefarah9720 Год назад

Great stuff! Best explanation ive seen so far

@joj0ee Год назад

The use of a power series at 13:20 to find the time complexity blew my mind. I never thought about how time complexities are actually proved.

@sainathsingineedi2922 2 года назад

Commenting for algorithm. Nice work 🔥

@insidecode 2 года назад

Appreciate it!

@palashsharma891 2 года назад

Algorithm haha 😂

@haziq7885 Год назад

Agreed, really good work 👏

@chrisogonas 5 месяцев назад

Remarkable illustration! Thanks Pal

@chandrashekharmuradnar5681 2 месяца назад

Very good stuff, thanks for the compiling this video.

@tanishq2766 Год назад

Never Ever Stop Making Videos, That's All I Got To Say, Period !

@someoneunknown2720 2 года назад

Never knew about the heaps . Again thanks for increasing my knowledge 😍😍🥰✌️

@insidecode 2 года назад

You're welcome!

@vikimazo 2 года назад

The best explanation of heaps! Thanks!

@insidecode 2 года назад

You're welcome!

@vadvoker Год назад

I'm completing the course called "Algirithms and data structures". There is only text explanation of such things and I thought "it's too complicated", but after your video everything became clear. Thanks a lot!

@insidecode Год назад

You're welcome! Yes a lot of resources lack visualization, which is necessary for some people to understand, this is why I'm planning to make a full algorithms and data structures course in this style

@vadvoker Год назад

Man, that's cool, clear and understandable! Thank you!

@insidecode Год назад

You're welcome!

@tommyp713 2 месяца назад

Thank you so much, this is a brilliant explanation

@concoursmaths8270 6 месяцев назад

this is amazing, i love it!!

@ohmegatech666 Год назад

This video is a treasure!

@HyperFocusMarshmallow 7 месяцев назад

13:28 I like that you present the math here. Props for that. The following is not a critique of any relevance but I can’t help pointing out that I found the following steps a bit funny: 1/2^{k-1} = 1^{k-1}/2^{k-1} = (1/2)^{k-1}. It’s maybe a bit convoluted and didn’t need so many steps. But no worries really.

@martingeorgiev999 Год назад

13:35 for people like me who get confused: the sum it's equal to 1/(1-x) for every x < 1 (in our case we have x = 1/2)

@MiaKaiser9 Год назад

wow your animation is crazy!! its so good!!

@insidecode Год назад

Thanks!

@apoorv0505 2 года назад

Great explanation. 🥂

@sayeedchowdhury11 2 года назад

great video, brother! MashA Allah

@user-vm9hl3gl5h 8 месяцев назад

14:22 time complexity of each operation. build=heapify=make an array as a binary heap.

@blaine_stl Год назад

of all videos I've scoured on binary heap this is the best

@insidecode Год назад

Thanks!

@ismailabi226 Год назад

Kayn akhay. char7 nadi, sauvitini, hit had partie mabghatch dkhol liya lrassi bmara

@jacquelineandrea616 Год назад

wow, best video of heaps ever

@SorestCode 18 дней назад

i want to ask how did you do the graphic effects and all stuff in the video which tools did you use? thanks!

@murnoth Год назад

Great content! Thanks for sharing!

@insidecode Год назад

You're welcome!

@AbdelazizElHayyany 5 месяцев назад

great explanation

@gagansaluja5523 2 года назад

you deserve millions of subscribers

@ryan_altalhi7901 7 месяцев назад

00:10 Heap data structure helps in quickly accessing the most important task 02:26 Storing a complete binary tree in an array is more efficient 04:30 Sift-up and sift-down operations maintain the heap property in a binary heap. 06:48 Operations in a heap 09:03 Updating and building heap in heapsort 11:16 Understanding the time complexity of heapifying. 13:34 Heapsort is a sorting algorithm using the heap data structure with a time complexity of O(nlogn) 17:05 Heapsort has O(nlogn) time complexity.

@HyperFocusMarshmallow 7 месяцев назад

10:21 It makes sense that for constructing the heap, sift up (I hope I’m correctly recalling which one is which) is better than sift down and that starting from the bottom is beneficial. Is this the best one can do? If so do you know of a good resource for the proof? I might try to figure it out in my own, but it’s at least nice to know whether I’m trying to prove or disprove it.

@esportsnexus 2 года назад

Best explanation ever! I'm gonna buy your udemy courses!

@insidecode 2 года назад

Thanks a lot!

@sequbeats Год назад

Great visualization!

@insidecode Год назад

You're welcome!

@Iamfafafel Год назад

Fantastic content

@davidondemand3631 2 года назад

bless your kind heart

@user-po1ym7pw8b Год назад

Sooo good, thanks

@spiritgaming6499 Месяц назад

Amazing video

@____r72 Год назад

this is such a good explanation

@insidecode Год назад

Thank you!

@adoq 3 дня назад

this video is amazing

@Iamfafafel Год назад

This is a minor point, but when you do the analysis of the build function and you take the derivative of the geometric series, you should keep in your notation that you’re evaluating at x=1/2. You’re abusing the letter x, but I get that space was already tight.

@ikram5011 2 года назад

thank u so much amazing explanation

@insidecode 2 года назад

You're welcomee

@elmeroranchero 6 месяцев назад

why is finding the element O(n) isn't it like a binary search essentially?

@ohmegatech666 Год назад

Somehow I didn't know about the // operator in Python until now. For anyone confused, it does the same thing as math.floor (a/b)

@reng7777 2 года назад

Genius!!!

@muzaffartursunov324 6 месяцев назад

super hard working

@edilgin622 5 месяцев назад

Isn't heapsort supposed to have O(1) space complexity? In your code you create a seperate array that holds the sorted data which would make it O(n). In the implementations that I saw they use the same heap array for sorting as well. Any help is welcome :)

@iezioaudi22 5 месяцев назад

Thanks!!!!

@richardlighthouse5328 Год назад

Couldn't you use binary search on the heap to get the index so updating element always cost O(log n), since the heap is always sorted?

@insidecode Год назад

No the heap is not always sorted

@safayetkhan2803 10 месяцев назад

Used to love ur videos but now I love these even more becaz of ur last word Inshallah

@eduardocruzism Год назад

Amazing

@danebutler4575 Год назад

Great tutorial! My only note is (pretty please) use a pop filter when you record your voice over. The plosives are kind of distracting :D. Thank you for putting this together though!

@dominiquekostler238 Год назад

I believe there's a minor mistake in the explination here 2:50. Shouldn't we be talking the floor of (i-1)/2 ? Since if we are for example at index 7 then only doing (7-2)/2 = 2.5. And there can't be a 2.5 index position in an array.

@insidecode Год назад

Yes, this is why in code at 4:24 I wrote parent = (i-1)//2, a//b in Python is equivalent to floor(a/b)

@dominiquekostler238 Год назад

@@insidecode I saw that later on, just wanted to point out to you if you want to edit the video position with a note saying it should be the floor instead of just how it is.

@chiragsharma8905 Год назад

That won't be the case in languages like Java, as for integer-integer operations, decimal is ignored. So, it will give us 2 only.

@aabibodd 2 года назад

put in the priority queue if two elements have the same priority the first one enters should be the first.

@insidecode 2 года назад

What do you mean by first one? First one in terms of what?

@dhuxdheerdahir2736 2 года назад

mash allah. bareekallahu feek

@mehdididit 2 года назад

BIEN OUEJ SYP

@lucas-bw6zu Год назад

think you skipped get max. I guess you could store a max heap with the min heap but that is 0n space complexity, or you could sort thru the array but that is 0n time complexity. Any other ways?

@insidecode Год назад

Usually to use a max heap we just use a min heap but by switching signs of keys when inserting

@lucas-bw6zu Год назад

@@insidecode thank you that makes sense. I was under assumption we could call get min and get max in the same heap, but I realize you wouldnt call "get max" on a min heap.

@ikamashki 4 месяца назад

18:43 that got me

@baba5788 2 года назад

Legend

@insidecode 2 года назад

Thankss

@ParthPatel-sr8mz 2 года назад

Can we connect on LinkedIn? May I ask your name?

@insidecode 2 года назад

I'm not active on LinkedIn sorry

@ugurkaraaslan9285 2 года назад

İnşaallah 👍

@ismail8973 2 года назад

Love from india👌

@insidecode 2 года назад

Thanks!

@ismail8973 2 года назад

@@insidecode bro i got placed in last week. Your vedeos helped a lot.

@sweetjimmy 2 года назад

@@ismail8973 Where did you get placed?

@ismail8973 2 года назад

@@sweetjimmy American Express

@allinonesomespecial4 5 месяцев назад

🤞👍👌

@lexkoal8657 Месяц назад

Sorry, but using x as a constant just doesn't feel okay 13:20

@tsunningwah3471 3 месяца назад

zhi

@tsunningwah3471 3 месяца назад

官方幸福高雄法國香港發現法國幸福高雄

@chi94 4 месяца назад

who else skipped the math part 😆

@midasredblade236 Год назад

you're muslim, didnt see that coming brother

@jeremygong4190 7 месяцев назад

Omg python looks so… unorganized, it’s like a group of lefters shouting for love and peace while there was no laws nor order… I mean, I can’t read any code without {} and ; 😂