1. Given an array of n-elements ? the 1st k -elements are in
descending order and k+1 to n elements are in
ascending order. give an efficient algo for searching an
element ?
2. Given an array of n-elements ? each element in the array is either
same or less by 1 or larger by 1 from the
previous element . give an efficient algo for searching an
element ?
e.g : 6 6 6 5 4 4 3 2 3 4 3 4 ............
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
