This textbook is available Logo
Discrete Mathematics With Applications 5th Edition

Discrete Mathematics With Applications (5th Edition)

Book Edition5th Edition
Section 11.5: Application: Analysis of Algorithm Efficiency II
Chapter 11, Section 11.5, TEST YOURSELF, Exercise 2
Page 825

To search an array using the binary search algorithm in each step, you compare a middle element of the array to ________. If the middle element is less than ________, you ________, and if the middle element is greater than ________, you ________.

Page 825