How to problem solve with Divide and Conquer
A useful method to get over a hurdle in software development is to break it down into smaller manageable parts and tackle those one by one. Then once all smaller parts are solved, put them all together to complete the puzzle.
Agile development is a good example of divide and conquer. The application is broken down into smaller parts, and developers start by doing the smallest thing possible to implement a feature or make a test pass.
It is also a good strategy when it comes to debugging. It’s often useful to strip your code down into smaller functions to sniff out what area is really the culprit. This is where unit tests can come in particularly handy. In a way, they already implement the divide and conquer technique.
There are many Divide and Conquer algorithms that have been devised. One of which is Quicksort. A basic level explanation of this algorithm is that Quicksort selects an element as a pivot point and sorts everything relative to that pivot point. It utilises recursion to select a pivot point within the already sorted points and keeps on sorting those elements until the array is fully sorted.

So remember, when building something large scale, think small!
