Ch Y11 sort/search

Which type of sort algorithm is this?

• Bubble
• Merge
• Insertion

A bubble sort goes through each pair in a list and swaps them if not in order.

• True
• False

How many passes are required to sort a list with 5 elements?

• 5

• 4

• 10

• 2

Your list is currently [4, 5, 1, 2, 6]. You have just finished the first pass of bubble sort.

Which two numbers will you compare next?

• 4 and 5

• 2 and 6

• 5 and 1

• 1 and 2

Which of the following are divide and conquer algorithms?

• merge sort

• bubble sort

• binary search

• linear search

When performing merge sort, the first thing you do is ...

• merge two lists

• split your list into two

• split your list into four

• compare each element to its neighbour

While performing merge sort, you currently have:

[4] [6] [7] [1].

What do you do next?

• start merging (4 with 6 and 7 awith 1)

• split each number into sublists

• start merging (4 with 7 and 1 awith 6

• split into two lists

Which algorithm is this?

• linear search

• binary search

• merge sort

• bubble sort

Which algorithm is this?

• linear search

• binary search

• merge sort

• bubble sort

Which algorithm is this?

• linear search

• binary search

• merge sort

• bubble sort