Answer:
Assuming this is 0 based array indexing, it would look like this...
[ 5, 6, 10, 7, 3, 2.5 ]
[ 0, 1, 2, 3, 4, 5, 6 ]
The index of 7 would be 3.
One advantage of Binary Search Algorithm:
Compared to Linear search it is much faster because linear search starts its searching right from the first value but binary searches for something by splitting the array in two again and again and again.
One disadvantage of Binary Search Algorithm:
Have to be sorted, unlike linear search that doesn't have to be.
Answer:
what is the answers it gave you?
