DSA For Non-Traditionals: 4 - Divide & Conquer and Quicksort

In the "DSA (Data Structures and Algorithms) for Non-Traditionals" series, I'll be going over algorithms that EVERY developer needs to be familiar with.

In this session, we'll be going over the CS concept of Divide & Conquer, why it's important, and then we'll look at it in action with the well-known Quicksort algorithm.

I'll also explain WHY you need to know these (PS It's not just theory)

Video key points:

• A review on recursion
• What is Divide & Conquer
• Divide & Conquer real-world example
• Divide & Conquer code example
• A review on the call stack and state retention
• What is quicksort?
• Quicksort code example
• How fast is quicksort?

Recording