Merge sort - Divide & Conquer
Merge-sort is an application of Divide and Conquer paradigm. To read more about Divide and Conquer, follow this post.
In merge-sort we follow following steps:
Read more...
Divide and conquer - concepts & applications
In divide-and-conquer, we solve a problem recursively, applying three steps at each level of the recursion:
1.Divide the problem into a number of sub-problems that are smaller instances of the same problem.
Read more...
Hi Folks..
ReplyDeletePlease write comments and feedback to improve this site and make this site a complete guide for coding geeks.