Consider the following array of numbers: [5, 3, 11, 9, 6, 8, 3, 10, 21, 15]

Lets say youre searching to see if 11 is on the list (I know, its obvious it is!). Show how a computer would implement a binary search to find this value. List each iteration.