Sorting Quiz #2

What is the main concept behind merge sorting?

• Insertion sort algorithm

• Selection sort algorithm

• Divide-and-conquer algorithm

• Bubble sort algorithm

What is the first step in the merge sort algorithm?

• Combine the sublists

• Sort the sublists individually

• Merge the sublists

• Divide the original array or unsorted list midway into sublists/subarrays

What is the second step in the merge sort algorithm?

• Divide the subarrays (lists) into even smaller subarrays (lists)

• Combine the two sorted sublists into one sorted list

• Sort each sublist recursively using merge sort

• Merge the two sorted sublists

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 is usually more efficient (takes fewer steps) in sorting a list of items?

• Bubble sort

• Merge sort

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 merge 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.

The following two lists are to be merged, which element first goes into the new merged list?

List 1

2 4 7 9

List 2

1 6 8 12

• 0

• 1

• 2

• 3

The following two lists are to be merged, which element will be in position 5 in the new merged list?

List 1

2 4 7 9

List 2

1 6 8 12

• 8

• 7

• 6

• 4