Linear and Binary Search

What is a linear search?

• A method of searching a list where you start at the beginning and check each item until you find what you're looking for or return a message saying not found.
• A method of searching a list where you divide the list into two halves and repeatedly narrow down the search range until the item is found or the search range is empty.
• A method of sorting data in alphabetical or numerical order.
• A notation used to assess the complexity and performance of an algorithm.

What is a binary search?

• A method of searching a list where you start at the beginning and check each item until you find what you're looking for or return a message saying not found.
• A method of searching a list where you divide the list into two halves and repeatedly narrow down the search range until the item is found or the search range is empty.
• A method of sorting data in alphabetical or numerical order.
• A notation used to assess the complexity and performance of an algorithm.

What is bubble sort?

• A method of searching a list where you start at the beginning and check each item until you find what you're looking for or return a message saying not found.
• A method of searching a list where you divide the list into two halves and repeatedly narrow down the search range until the item is found or the search range is empty.
• A method of sorting data in alphabetical or numerical order.
• A notation used to assess the complexity and performance of an algorithm.

What is Big O notation?

• A method of searching a list where you start at the beginning and check each item until you find what you're looking for or return a message saying not found.
• A method of searching a list where you divide the list into two halves and repeatedly narrow down the search range until the item is found or the search range is empty.
• A method of sorting data in alphabetical or numerical order.
• A notation used to assess the complexity and performance of an algorithm.

Which search method is more effective for large lists?

• Linear search
• Binary search

What is the main difference between linear and binary searches?

• Linear search works on unsorted lists, while binary search requires a sorted list.
• Linear search requires more comparisons than binary search.
• Binary search works on unsorted lists, while linear search requires a sorted list.
• Binary search requires more comparisons than linear search.

Which search method is more efficient for finding an item in a sorted list?

• Linear search
• Binary search

What is the time complexity of a linear search?

• O(1)
• O(n)
• O(log n)
• O(n^2)

What is the time complexity of a binary search?

• O(1)
• O(n)
• O(log n)
• O(n^2)

In a binary search, what is the first step after checking the middle item?

• Check if the item is found
• Check if the item is greater than the middle item
• Check if the item is smaller than the middle item
• Check if the item is equal to the middle item