Computer Sciences > GATE 2015 SET-2 > Searching
An unordered list contains n distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is
Correct : d
Similar Questions
An array A of length n with distinct elements is said to be bitonic if there is an index 1≤i≤n such that A[1..i] is sorted in the non-decreasing order and...
A palindrome is a word that reads the same forwards and backwards. In a game
of words, a player has the following two plates painted with letters.
From...
Which number does not belong in the series below?
2, 5, 10, 17, 26, 37, 50, 64
Total Unique Visitors
Loading......