Quiz Complete, well Done!
What is a linear search?
Array
Comparison
Linear search checks every item in the list and has a worst-case **
** of O(n).
In a linear search, the average time complexity is **
** of O(n), where n is the number of items in the list.
In a linear search, the items are checked **
** until the target item is found.
Index
|
|
|
|
|
|
|
|
|
|
What is the drawback of linear search compared to binary search?
What is linear search also commonly known as?
In which data structure is linear search most commonly used?
Linear search can be easily implemented using a **
** loop to iterate through the items in the list.
What is the best-case time complexity of linear search?
Big O notation
Boolean
O(n)
Linear Search
Sequential Search
In which type of data does linear search perform best?
In a linear search, the worst-case scenario occurs when the target item is **
** or not in the list.
