Year 9 Algorithm Recap

What does bubble sort repeatedly do to sort a list?

• Divides the list into smaller lists and sorts them.

• Places all items into a bucket and then sorts them.

• Compares each pair of adjacent items and swaps them if they are in the wrong order.

• • Selects the largest item and places it at the end of the list.

How does a bucket sort order a list?

• Swapping adjacent elements until the whole list is sorted.

• Sorting elements into groups and then sorting the groups.

• Dividing the list into two halves and sorting each half.

• 
  Selecting the smallest element and moving it to the front.

How does a linear search find an element in a list?

• By dividing the list in half repeatedly until the element is found.

• By organizing the list into a binary tree and traversing it.

• By checking every element from the start to the end until the element is found.

• • By sorting the list first and then checking the middle element of the list.

How does a binary search find an element in a list?

• By dividing the list in half repeatedly until the element is found.

• By organizing the list into a binary tree and traversing it.

• By checking every element from the start to the end until the element is found.

• • By using a unique hash code to find the element.

What is a disadvantage of using bubble sort?

• It can be slower compared to other sorting methods for large lists.

• It cannot sort numbers.

• It is too complex to understand.

• • It requires a lot of extra space.

What's one thing that can make an algorithm efficient?

• It uses a lot of memory.

• It is difficult to code.

• • It can only solve simple problems.

• It completes tasks quickly.

What happens when all elements in bucket sort end up in a single bucket?

• The sorting becomes faster.

• The sorting speed remains unchanged.

• • The algorithm automatically redistributes the elements into more buckets.

• The sorting process becomes similar to using another sorting method within that bucket.

What is important for coding an algorithm easily?

• The amount of data to be processed.

• The programming language's popularity.

• Understanding the steps and logic of the algorithm clearly.

• • The speed of the computer.

Why might you use linear search over binary search?

• When the list is very large.

• When the list is small and not in order.

• When the list is already sorted.

• • When you need to find multiple occurrences of the same element.

What is a simple way to describe how bubble sort works?

• Sorting elements randomly
• Repeatedly swapping adjacent elements if they are in the wrong order.
• Reversing the array
• Selecting elements based on their index