c++
Find pair with given sum in a circularly sorted array
Given a circularly sorted array of integers, find a pair with a given sum. Assume there are no duplicates in the array, and the rotation is in an anti-clockwise direction around an unknown pivot. For Read more…