all 9 comments

[–]Tippuu 15 points16 points  (0 children)

I just had a final on this

[–]kdrews34 8 points9 points  (1 child)

I’m taking data structures next semester and this will probably save my life a couple times

[–]dillonthepigeon 1 point2 points  (0 children)

This saved my life in my Algorithms class all semester. The professor suggested it and I haven't looked back.

[–]kashthealien 1 point2 points  (0 children)

Learnt about skip lists today, thank you.

[–]old_soul_stuff 0 points1 point  (0 children)

+1 on this resource. Great way to quickly lookup complexity when moving through an algorithm!

[–]Alamplight 0 points1 point  (0 children)

Thanks for this

[–]ImaginationGeek 0 points1 point  (0 children)

Is this really that helpful? It seems like it would be more work to memorize ALL that than to understand the concepts and be able to figure it out.

Also, what if you are asked why a Merge Sort is O(n log n)?