- Algorithms
- Recursion
- Call Stack
- Iterative Approach
- Memoization
- Head Tail
- Data Structures
- Arrays, Sets
- Time Complexity
- Hash Tables
- Stacks
- Queues
- Linked Lists
- Binary Search Trees
- Tries
- Graphs
- Divide Conquer
- Binary Search
- Quicksort ♣
- Merge Sort
- Karatsuba Multiplication
- Graph Traversal
- Flood Fill
- Depth First Search
- Breadth First Search
- Dijkstra's Algorithm
- Decision Making
- Minimax
Algorithms
Machine Learning
Divide Conquer / Quicksort »
In quicksort algorithm we use partitioning technique. We separate the items in two piles, A-M and N-Z. We compare the left item with the pivot M. If left < right, we swap the items.
What divide-conquer technique is used in quicksort? How partitioning works?
Click to Flip Card
