Algorithms Review

What is the first step of the linear search algorithm?

• Identify the middle item in the list

• Identify the first item in the list

• Identify a random item in the list

• Identify the last item in the list

Which of the following search algorithms can only be carried out on an ordered list?

• Linear search

• Binary Search

Which sorting algorithm is the most efficient?

• Bubble sort

• Merge Sort

Consider the following algorithms. Assume that you have a deck of cards with numbers on them and you are looking for a card with a specific number. Which of the following statements is true?

• Algorithm 1 is an example of a linear search. It will work for any list. Algorithm 2 is a binary search and needs to be sorted.

• Algorithm 1 is an example of a linear search. It needs to be sorted. Algorithm 2 is a binary search and it will work for any list.

• Algorithm 1 is an example of a binary search. It will work for any list. Algorithm 2 is a linear search and needs to be sorted.

• Algorithm 1 is an example of a binary search. It needs to be sorted. Algorithm 2 is a linear search and it will work for any list.

What is an advantage of linear search over binary search?

• It can be done on unsorted lists

• It is more challenging to code

• It is efficient

• It is quicker with lists which have fewer than 12 terms

What is a disadvantage of bubble sort?

• It is inefficient

• It doesn't work effectively on sorted lists

• It doesn't work on unsorted lists

• None of the provided options

What is a disadvantage of merge sort?

• It is a more complicated algorithm to implement

• It doesn’t work on unsorted lists
• It is slow
• It is quicker

What is an advantage of merge sort over bubble sort?

• It is more efficient

• It is more difficult to implement

• It can work on all types of lists

• None of the provided options

What is an advantage of bubble sort over merge sort?

• It is easier to implement

• It works on all lists

• It is always faster

• It is slow

What is a disadvantage of binary search?

• More difficult to implement than linear search

• It is slow and less efficient

• It doesn't do anything in sorted lists

• It doesn’t work on lists that are of length greater than 4