Searching & Sorting Algorithms

Which is NOT a sorting algorithm?

• Bubble Sort

• Binary Sort

• Insertion Sort

• Merge Sort

Which is the least efficient sorting algorithm for a large data set?

• Bubble sort

• Merge sort

• Insertion sort

• Binary sort

Which is the most efficient sorting algorithm for a large data set?

• Bubble sort

• Merge sort

• Insertion sort

• Binary sort

Which sorting algorithm has the biggest memory usage?

• Bubble sort

• Merge sort

• Insertion sort

• Quick sort

Which searching algorithm does NOT need the data to be sorted?

• Linear search

• Binary search

Which is the "best case scenario" for a quick find in a linear search?

• The search item is at the start

• The search item is in the middle

• The list is small

• The list is not sorted

Which is the "best case scenario" for a quick find in a binary search?

• The search item is at the start

• The search item is in the middle

• The list is small

• The list is not sorted

Which of these statements is true for a binary search?

• The algorithm only searches for 0 or 1

• The data must be sorted in order

• It is very inefficient for large data sets

• It is very inefficient for small data sets

Which of these statements is true for a linear search?

• The algorithm only searches for 0 or 1

• The data must be sorted in order

• It is very inefficient for large data sets

• It is very inefficient for small data sets

Which algorithm splits up a list into smaller sub lists?

• Linear Search

• Bubble Sort

• Binary Search

• Merge Sort