All Flashcards
How is Linear Search applied in real-world scenarios?
Searching for a specific product in a small online store inventory, finding a specific contact in a small phone book, or searching for a file in a directory.
What are the differences between Linear Search and Binary Search?
Linear Search: Works on unsorted data, O(n) time complexity. | Binary Search: Requires sorted data, O(log n) time complexity.
What is the key principle of Linear Search?
Examining each element of a list in sequence until the target element is found or the entire list has been checked.
What is the time complexity of Linear Search in the worst-case scenario?
O(n), where n is the number of elements in the list.
What is the time complexity of Linear Search in the best-case scenario?
O(1), when the target element is the first element in the list.
Does Linear Search require the data to be sorted?
No, Linear Search can be used on unsorted data.
What are the advantages of using Linear Search?
Simple to implement, works on unsorted data.
What are the disadvantages of using Linear Search?
Inefficient for large datasets compared to other searching algorithms.