01 Searching Algorithms

What is an algorithm?

• A recipe for cooking
• A type of plant
• A set of instructions for solving a problem or accomplishing a task
• A type of animal

What is the purpose of linear search?

• To find a specific item in a list

• To sort a list of items

• To divide the list of items in half

• To eliminate half of the list each time

How does linear search work?

• By sequentially checking each item in the list

• By dividing the list in half each time

• By comparing the middle item with the target item

• By calculating the middle index of the current list of items

What is the requirement for binary search?

• The list of items must be sorted in ascending order

• The list of items can be sorted or unsorted

• The list of items must be in reverse order

• The list of items must be randomly arranged

How does a binary search narrow down the items in this list each time?

• By sequentially checking each item in the list

• By dividing the list of items in half

• By comparing the middle item with the first item

• By calculating the middle index of the current list of items

Which search algorithm requires fewer comparisons?

• Linear search

• Binary search

• Both require the same number of comparisons

• It depends on the size of the list

What happens if the target item is not found in linear search?

• The remaining list is divided in half

• The algorithm tells you the item is not in the list

• The search continues until the end of the list

• The search stops immediately

What happens if the target item is not found in binary search?

• The list of items is divided in half

• The algorithm tells you the item can not be found

• The search continues until the end of the list

• The search stops immediately

Which search algorithm is more efficient?

• Linear search

• Binary search

• Both are equally efficient

• It depends on the size of the list

What is the main difference between linear search and binary search?

• Linear search checks items one by one, while binary search divides the remaining list in half

• Linear search requires a sorted list, while binary search works on unsorted lists

• Linear search requires fewer comparisons, while binary search requires more

• Linear search is more efficient, while binary search is less efficient