Heap Sort is Way Easier Than You Think!

preview_player
Показать описание
Heap Sort is Way Easier Than You Think!
Рекомендации по теме
Комментарии
Автор

Master Data Structures & Algorithms For FREE at AlgoMap.io!

GregHogg
Автор

I got multiple offers after watching your videos. Now I’m just watching you 😅

daviddong
Автор

"How come someone so smart is also so handsome" - all the chicks 😂

geekwithabs
Автор

"Handsome programmer like myself"🗿

ankitrajxd
Автор

O(n) is faster than O(n logn ) right...?

HariHaran-xrr
Автор

Lol @ the most handsome programmer in the world. Im sure a lot of laddeees would agree

onehmong
Автор

Why not do a merge sort (O n log n) and take the first element? It's same as heap sort right?

rohan
Автор

Please emphasize more on the python implementation again ... i realized you changed it to stop copycatters

onehmong
Автор

I wonder if merge sort is better than this. Also good work appreciate your knowledge

amartyapanja
Автор

Question isn't your code o(n) space as you create a new list of size n?

jewsefjones
Автор

I would have needed that 3 Days ago for an exam, youtube algorithm you have failed me

Bajuvare