Divide and conquer is algorithmic design pattern, to explained it as quickly as possible without getting too deep into the mathematical proofing and development of this type of algorithms it breaks down as follows.
- Divide:
- Recurse:
- Conquer:
Break down the problem into half that break those half into another half until there is only one element, then solve the problem by
doing one single comparison and return.
Recursively solve the problem.
Now it’s time to merge them all into one big solution, this where the “popping off the stack” happens for the recursion.
I always had a passion for the field of STEM (Science, Technology, Engineering, and Math) and I knew I wanted to do something to make a difference in the world. I just didn’t know where to start. I was an immigrant in a new country, grew up in a tough environment, and wasn’t sure how… Read More
