2.1 Algorithms - CT, Searching + Sorting Algorithms

Question 1

What is computational thinking?

Answer 1

Solving problems that can be implemented by a computer system

Question 2

What type of list does a bubble sort sort?

Answer 2

An unordered list of items.

Question 3

How does a bubble sort work? (2 marks)

Answer 3

Largest item “bubbles” up to the end of the list in successive passes (one-by-one).

Question 4

When does a bubble sort finish?

Answer 4

When there are no more swaps that need to be made.

Question 5

How does a bubble sort work in simple terms?

Answer 5

Bubble sort = items move right

Question 6

What is a disadvantage of bubble sort?

Answer 6

Most inefficient sorting algorithm.

Question 7

What is an advantage of bubble sort?

Answer 7

Very easy to implement.

Question 8

Is bubble sort good for small or large data sets?

Answer 8

Small data sets

Question 9

Is insertion sort good for small or large data sets?

Answer 9

Small data sets

Question 10

Is a bubble sort or insertion sort more efficient and why?

Answer 10

Insertion sort because it has less swaps.

Question 11

How does an insertion sort work?

Answer 11

Compare each item to value on the left.

Question 12

How does an insertion sort work in simple terms?

Answer 12

Insertion sort = items move left