AQA GCSE Computer Science - 3.1.2 Efficiency of algorithms

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 is always faster?

• Neither
• Binary search
• Linear search
• Both

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

How many items would need to be examined if binary search was carried out on a list of 10 million items? (You may need a calculator and powers of 2 for this!)

• 24 times
• 23 times
• 40 times
• 10 million times

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

What is an advantage of merge sort over bubble sort

• It is quicker and more efficient
• It is more challenging to code
• It can work on all types of lists
• None of the provided options

What is a disadvantage of merge sort?

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

What an advantage of bubble sort over merge sort?

• It is easier to code
• It works on all lists
• It is always faster
• It is slow

What is an advantage of binary search over linear search

• It is quicker and more efficient
• It works on all lists
• It is easier to code
• None of the provided options