index = 0
WHILE (index < number of items in the list)
{
IF (list[index] == target element)
{
RETURN index
}
index = index+1
}
(1 point)
Responses
binary search
binary search
linear search
linear search
quicksort
quicksort
hashing
1 answer
The pseudocode you provided represents a linear search algorithm. In linear search, the algorithm iterates through each element of the list one by one until it finds the target element or until it reaches the end of the list.
So, the correct response is:
linear search
