Question

Fill in the code

Procedure BinaryPeak(a_1, a_2, ..., a_n: 1. t:= 1 2. j:= n 3. while (t < j) 4. m [j/2] 5. if 6.:= m + 1 7. else 8. j:= m 9. return t

Answer 1

Binary peak selecting a peack value or a value that is needed by the user using bianry search here we have n number of elements and you need to find a value among those values for to find a value using binary search those n elements must be sorted find middle middle-(starttend)/2 then check for a condition that middle is equals to key or not if(middle-search key) if middle seacrh_key seacrh success other wise middle>search key then start-middle+1; or middle<seacrh_key then end-middle-1; middl start end middle-l11/21-6 do this untill key found