Sorting Algorithms & Efficiency

When does binary search not work?

• When the list is unsorted
• When the list is sorted
• When the list is very large
• When there are negatives in the list

What is an advantage of linear search over binary search

• It can be done upon unsorted lists
• It is more challenging to code
• It is efficient
• It is quicker with lists which have less than 12 terms

What is a disadvantage of bubble sort?

• It is slow and inefficient
• It doesn't do anything in sorted lists
• It doesn't work on unsorted lists
• None of the provided options

How does bubble sort sort items in a list?

• It repeatedly compairs pairs of adjacent elements and swaps them until they are sorted
• It splits the list in half till each sub-array is of length 1 and merges them into the right order
• It repeatedly compairs two elements and swaps them until they are sorted
• None of the provided options

What is Algoritmic efficiency?

• The time and space taken to run the algorithm
• How long it takes to design the algorithm
• How clear the algorithm is
• How long it takes to program the algorithm

Which line best represents the time complexity n!

• Orange

• Blue

• Green

• Red

• Pink

Which line best represents the time complexity log n

• Orange

• Blue

• Green

• Red

• Pink

Which line best represents the time complexity n

• Orange

• Blue

• Green

• Red

• Pink

Find the slowest time complexity

• O (n)

• O (n^2)

• O (n!)

• O (2^n)

How does linear search search for an item in a list?

• None of the provided options
• It repeatedly splits the list in half
• It compares pairs of items
• looks at all odd terms