Binary Search:
In order to implement binary the array must be previously sorted. Then by the help of divide and conquer strategy we can easily find out the searched element by dividing theme into sub problems and lastly combining it.
Quick Sort:
If we look for the efficiency in solving a sorting problem divide and conquer strategy is one of the best solution. By figuring out the right index for the pivot element and by implementing the partition method we can sort the other elements of the array along the way.