Learn and share programming fundamentals here

Given a sorted array of n integers that has been rotated an unknown number of times, write code to find an element in the array. You may assume that the array was originally sorted in increasing order.

A magic index in an array A[0…n-1] is defined to be an index such that A[i] = i. Given a sorted array of distinct integers, write a method to find a magic index if one exists, in an array A. FOLLOW UP: What if the values are not distinct?

Find the element that appears once in a sorted array where all other elements appear twice one after another. Find that element in 0(logn) complexity. Input: arr[] = {1, 1, 3, 3, 4, 5, 5, 7, 7, 8, 8} Output: 4 Solution : Test Cases: 1) {} 2) {1,1,5,7,7} 3) {1,1,2,2,7} 4) {2,3,3,5,5,7,7}