Bubble and Merge Sorts

Which of these are sorting algorithms?

• Bubble

• Merge

• Binary

• Linear

• Caesar

Which of these algorithms compares consecutive pairs of items and swaps two items if they're not in order?

• Bubble sort

• Linear search

• Merge sort

• Binary search

Which of these algorithms sorts items by first splitting the list of items down into smaller and smaller groups?

• Bubble sort

• Merge sort

• Linear search

• Binary search

Which of these algorithms is usually more efficient (takes fewer steps) in sorting a list of items?

• Bubble sort

• Merge sort

What algorithm does this image represent?

• Bubble sort

• Merge sort

• Linear search

• Binary search

Which algorithm does this image represent?

• Bubble sort

• Merge sort

• Linear search

• Binary Search

What is a sorting algorithm?

• Specific instructions which allow us to understand code

• Specific instructions which allow us to organise data in a particular way

• Kinda like a word-scrambler

• Kinda like a password-decrypter

What is the most important reason that data needs to be sorted?

• It is organised and easier to make sense of.

• So it looks nice.

• To show we can do it.

How do bubble sorts work?

• They split the list to single elements before piecing them back together, one sublist at a time.

• Each item in the list is compared with the following item starting with the last value till the first.

• Taking one item at a time from an unsorted list, each new item is compared with the previous until its place is found.

• Each item in the list is individually compared with the following item starting with the first value till the last.

What is an advantage of a bubble sort?

• It is difficult to implement.

• It is fast.

• It uses less memory.

• It is easier to implement and follow.