How can the following algorithm be described?
Position = 0
While position

Name: How can the following algorithm be described? Position = 0 While position < len(lyst): If target == lyst[ position ]: Return position Position += 1 Return -1 A) binary search B) bubble sort C) sequential search D) selection sort
Brand: Quizplus
Rating: 4.8 (35 reviews)

Question

How can the following algorithm be described?
Position = 0
While position < len(lyst):
If target == lyst[ position ]:
Return position
Position += 1
Return -1
A) binary search
B) bubble sort
C) sequential search
D) selection sort

Quizplus · Accepted Answer

The algorithm is performing a sequential search by iterating over a list until it finds the target value or reaches the end of the list.

How Can the Following Algorithm Be Described