You have an array A of size N [divisible be 3] populated with unique values. You have divided this array into three equal parts and every part is in sorted order that can be ascending or descending. You have to design a solution that can find the min value from the array in the possible number of comparisons. Find the value and tell that how many comparisons you will need exactly.

Answer rating: 100% (QA)

Input Format First line contains the size of array N divisible be 3 Second li... View the full answer