There is a sorted list S (1.....m) which contain n element and n is even no. S' is generated by the S in which odd numbered position of the half sorted list is replace with some odd no position of other half. Design an algorithm that find element x in the given S' with O(logn) times

• Definitely!not a question to be asked here...ask it on stackoverflow.com
• 10 years agoHelpfull: Yes(2) No(2)