Hey there,

Could someone please explain the Divide and Conquer approach in Java.

All I know is that, for divide and conquer approach requires data to be sorted.

So basically we can either choose to do linear search or opt to do divide and conquer approach. What is the difference between them? Is one better than another?

I really need a clarification for this one.

Thank you in advance.