i am struggling in divide and conquer algorithm i am not able to think algo that solves by divide and conquer . please help someone

Well divide and conquer is pretty common, but you offen use it without even knowing it. I think, that the most famous algorithm using this idea is merge sort.

Here are two another problems:

You have got sequence of integer numbers (positive and negative). Find continuous subsequence with maximum sum in *O(n log n)*. (There exist even better solution, but without D&C)

And harder one: You got *n* points in the plane. Find two of them with minimum distance also in *O(n log n)*.

Here is the link of the problems based on divide and conquer. Hope it might help…

2 Likes

please give some links to the questions based on this concept from the practice section…it will be helpfull…