Divide and conquer


Binary search is a method to find the particular item in the sorted array. In each step, the algorithm divides the array equally and match the middle item. If the key match, return the index. If the key is less then middle, search left subarray. Else search right subarray.

Write a function to find minimum and maximum value from the queue. You can use two stacks to store the values. Stack uses last in first out approach to push and pop elements.

Merge sort is a divide and conquers and comparison-based sorting algorithm. It divide the array into subarray and conquer recursively sorting two subarrays. It combines the results into a final array.

Quicksort is an efficient comparison sort algorithm compare than other sorting algorithm. It can operate in place on an…