Unit 9 Searching and Sorting

What does a linear search do?

• Looks at the first item of data, then each one in turn, until it finds the data item requested

• Organizes the data into alphabetical order

• Splits the data until the requested data is found

What is an advantage of a linear search?

• It is very quick
• It only works with ordered lists
• It is a simple algorithm

What does a binary search do?

• Looks at the first item of data, then each one in turn, until it finds the data item requested
• Converts all the data into binary
• Takes the data and splits it in half repeatedly until it finds the data item requested

What is an advantage of a binary search

• It's very quick
• It only works with ordered lists
  
• It is a simple algorithm

What is the biggest disadvantage of a binary search?

• It is slow
• It can only be used if the data is sorted into an order
  
• It takes the data and keeps dividing it in half until it finds the item it is looking for

Which of these algorithms sorts items by first splitting the list of items down into smaller and smaller groups?

• Selection sort

• Merge sort

• Linear search

• Binary search

What algorithm does this image represent?

• Selection sort

• Merge sort

• Linear search

• Binary search

Which of these algorithms eliminates half of its possibilities each time it makes a check?

• Binary search

• Selection sort

• Merge sort

• Linear search

Which algorithm does this image represent?

• Linear search

• Binary search

• Selection sort

• Merge sort

Which type of sort algorithm is this?

• Insertion

• Merge

• Selection