2.3.3 - Sorting Algorithms

Question 1

What is the purpose of a sorting algorithm?

Answer 1

They are designed to take a number of elements in any order and output them in a logical order.

Question 2

What are the four sorting algorithms?

Answer 2

Bubble sort

Insertion sort

Merge sort

Quick sort

Question 3

How does a bubble sort work?

Answer 3

A bubble sort makes comparisons and swaps between pairs of elements.

Question 4

What is the time complexity of the bubble sort algorithm?

Answer 4

O (n²).

Question 5

How does an insertion sort work?

Answer 5

The insertion sort places elements into a sorted sequence.

Question 6

What is the time complexity of an insertion sort?

Answer 6

O (n²).

Question 7

How does a merge sort work?

Answer 7

A merge sort splits the data into lists of size one and then merges them together in order. It is a divide and conquer algorithm.

Question 8

What is the time complexity of a merge sort algorithm?

Answer 8

O (n log n)

Question 9

How does a quick sort work?

Answer 9

A quick sort works by selecting a pivot and sorting the list by comparing it to the pivot.

Question 10

What is the time complexity of the quick sort algorithm?

Answer 10

O (n²).