Question: 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


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.

Step by Step Solution

3.36 Rating (149 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Now once we have the three elements sorted not counting the comparisions th... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Algorithms Questions!