Virtual Labs

What is the key feature of Linear Search?

It compares adjacent elements
It checks elements sequentially
It divides the array into halves
It uses a binary tree structure

What is the best-case time complexity of Linear Search?

O(1)
O(n)
O(log n)
O(n²)

When does Linear Search stop?

After comparing all elements
After sorting the array
When the target element is found
After dividing the array

Which type of dataset is most suitable for Linear Search?

Large sorted datasets
Small or unsorted datasets
Arrays with duplicate values
Arrays with missing elements

What is the worst-case time complexity of Linear Search?

O(n)
O(log n)
O(1)
O(n²)

Linear Search Pretest