Let A be an array of integers , sorted in increasing order….
Let A be an array of integers , sorted in increasing order. A shift of A by k, denoted by , means removing the last k elements and placing them at the beginning. For example, if A= {1, 2, 3, 4, 5, 6, 7} and k = 3, then = {5, 6, 7, 1, 2, 3, 4}. Design a divide and conquer algorithm that takes as input a sorted array A that has been shifted by an unknown 0