How can the following algorithm be described? left = 0
Right = len(sortedLyst) - 1
While left

Question

How can the following algorithm be described? left = 0
Right = len(sortedLyst) - 1
While left <= right:
Midpoint = (left + right) // 2
If target == sortedLyst[midpoint]:
Return midpoint
Elif target < sortedLyst[midpoint]:
Right = midpoint - 1
Else:
Left = midpoint + 1
Return -1
A) binary search
B) bubble sort
C) sequential search
D) selection sort

Quizplus · Accepted Answer

This algorithm is performing binary search, as it is dividing the sorted list in half repeatedly to locate the target element.

How Can the Following Algorithm Be Described? Left = 0