Skip to content

Latest commit

 

History

History
17 lines (13 loc) · 603 Bytes

divide-and-conquer.md

File metadata and controls

17 lines (13 loc) · 603 Bytes

Divide and conquer

{% hint style="info" %} This technique involves breaking a problems down into smaller sub-problems, solving each sub-problem recursively, and then combining the solutions to the sub-problems to obtain a silution to the original problem. {% endhint %}

{% embed url="https://gist.github.com/Aisuko/03bbf80620b6ea1760041b8a80a58e4a" %} Binary search {% endembed %}

{% embed url="https://gist.github.com/Aisuko/7e8308dc88dfa7ced69af1e4a6bdbaaa" %} Merge sort {% endembed %}

{% embed url="https://gist.github.com/Aisuko/58df83b47c8e450d9628e335e75157e8" %} Quick sort {% endembed %}