How does Quicksort work? Why it's complexity is nLog(n) on average?
Preparing for a tech interview? https://devstory.page.link/technical-...


On this video I talk about Quicksort one of the most important sorting algorithms. I describe the algorithm as well as perform complexity analysis on it.


If you are in a hurry and want to get a grasp of basic CS Fundamentals quickly, specially to review topics for technical interviews, I think this video might be useful to you.

I have other resources, like free to download (no registration needed) guides https://devstory.page.link/study-guides

Here are some books I recommend to learn more about the topics I've talked so far (this are personal recommendations, but I might receive money based on clicks or purchase):

Cracking the coding interview (https://devstory.page.link/cracking-t...)
The Algorithm Design Manual (https://devstory.page.link/algorithm-...)

If you are preparing for a technical interview don't miss my playlist: https://devstory.page.link/technical-...

Tell me what you think, if you like it or not, or if I missed something you'd like to see.

Like, share or subscribe if you enjoyed it :)