How does Quicksort work? (in 6 minutes)

How does Quicksort work? Why it's complexity is nLog(n) on average? Preparing for a tech interview? devstory.page.link/technical-interview-prep 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 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 (devstory.page.link/cracking-the-code) - The Algorithm Design Manual (devstory.page.link/algorithm-design) If you are preparing for a technical interview don't miss my playlist: devstory.page.link/technical-interview-prep 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 :)

• #science_technology
• #quicksort
• #computer_science
• #technical_interview
• #sorting_algorithms
• #programming
• #software_development
• #algorithms
• #quicksort_algorithm
• #quicksort_java
• #quicksort_example
• #quicksort_algoritm
• #quick_sort
• #quick_sort_explained
• #sorting algorithms
• #sorting_algorithms_explained
• #sorting
• #algorithms
• #sorting_algorithms_visualized
• #sort
• #quicksort
• #computer_science_101
• #learn_computer_science