Divide and Conquer algorithm problems tutorial
Divide and conquer is an algorithm design paradigm based on multi-branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub-problems of the same (or related) type, until these become simple enough to be solved directly. The solutions to the sub-problems are then combined to give a solution to the original problem.
Divide and Conquer is an algorithmic paradigm. A typical Divide and Conquer algorithm solves a problem using following three steps.
1. Divide: Break the given problem into sub-problems of same type.
2. Conquer: Recursively solve these sub-problems
3. Combine: Appropriately combine the answers
Following are some standard algorithms that are Divide and Conquer algorithms.
1) Binary Search
2) Quicksort
3) Merge Sort
Contact:
Debarghya Mukherjee
(+91)-9038787021
debarghya_mkr@yahoo.com
On this page of the site you can watch the video online Divide and Conquer algorithm problems tutorial with a duration of hours minute second in good quality, which was uploaded by the user Debarghya Mukherjee 09 November 2014, share the link with friends and acquaintances, this video has already been watched 118,642 times on youtube and it was liked by 416 viewers. Enjoy your viewing!
