Classic Algorithms Quick Check
2 of 52 of 5 Items
Question
Which of the following search algorithms is represented by the pseudocode?
index = 0
WHILE (index < number of items in the list)
{
IF (list[index] == target element)
{
RETURN index
}
index = index+1
}
(1 point)
Responses
hashing
hashing
binary search
binary search
quicksort
quicksort
linear search
2 answers
linear search
no clue i am in the same boat as you!!