Linear search

Searching by checking elements one by one.

Progress

0/4 solved

4 questionsConcept practice0/4 answeredQuestion 1 of 4

Question 1

Which algorithm generally has the better worst-case time complexity for finding a value in a sorted array?

Linear search, because it always checks fewer elementsBinary search, because it reduces the remaining search space by half each stepSorting, because it rearranges the array before searchingA for loop, because loops are faster than search algorithms