Data Structures & Algorithms in Swift, Episode 16: Heap Sort | Kodeco

Now that you're able to sift down elements in a heap, Heap Sort is trivial to implement. Finish off your Heap by sifting in the other direction: up.


This is a companion discussion topic for the original entry at https://www.kodeco.com/977854-data-structures-algorithms-in-swift/lessons/16

I really think u need to add more visual samples, like the cards on the previews leasons, in my case (and sure another I am more visual learning, thats cause I bought this curse, not to only see the code, its pretty hard, learing only seeing code )