Related to divide and conquer algo

#1

does the d&C / binary search concept always applicable to problems with sorted arrays?
Or is it related to finding out a monotonic space for a problem whether the array in problem is sorted or not?

#2

@pradhumangupta99 hey ,its not neceassary ki divide and conquer jo hai sorted pr lge it all depend on condition of question ,but binary search is type of divide and conquer algo so binary search to slorted array pr hi lg skti hai.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.