Common Algorithms Quiz

What is a linear search?

• A sequential method for sorting elements within a list.

• A sequential method for sorting and finding an element within a list.

• A sequential method for finding an element within a list.

• A sequential method that reduces the size of a list.

How many checks will a linear search take to find number 6 in the list?

3, 4, 7, 6, 5, 1

• 3

• 7

• 5

• 4

Linear search is more efficient than binary search

• True

• False

What is important to know about the data for binary search?

• The data can only be numbers

• The data can only be letters

• The data in the list must be sorted

• The data must be very small

With a data set of 0,1,3,6,7,8,9

How many steps would a binary search take to find the value 8?

• 2

• 4

• 3

• 7

Which sorting algorithm is more efficient with longer lists of data?

• Merge Sort

• Bubble Sort

• Both

• Neither

Why might a sorting algorithm be needed before a search?

• Data is better when ordered

• Data always needs to be in order before searching

• The search algorithm may be in the code before the sorting algorithm

• The search algorithm may need the data to be in order

What is a search algorithm?

• An algorithm for finding an item in a list

• An algorithm for finding an item in code

• Code for finding an item in a list

• an array for sorting and finding an element in a list

What is a sorting algorithm?

• An algorithm for saving programming code

• An algorithm for compiling and checking programming code

• An algorithm for organising data in order

• An algorithm for organizing data into an unsorted tuple

Bubble sort is more efficient than merge sort

• True

• False