2.1 Sort Algorithms

Question 1

Sort Algorithm

Answer 1

A sort algorithm is a set of instructions to arrange a dataset into a particular order.

Question 2

Efficient Sorting

Answer 2

An efficient sort algorithm is one which can sort a dataset in a short time.

Question 3

What are the three examples of sorting method

Answer 3

• Bubble sort
• Insertion sort
• Merge sort

Question 4

Bubble sort

Answer 4

• Compare the first two items of the dataset:
  
  • Swap these items if they aren’t in the right order.
• Continue for the rest of the cards in the deck.
• Repeat the whole process, until a pass with no swaps happens.

Question 5

Pros and Cons of bubble sort

Answer 5

Easy to implement
Does not use much memory

Poor efficiency

Question 6

Insertion sort

Answer 6

Compare 2nd card with previous card
then 4rd card with 2nd card
repeat this for the whole list

Question 7

Pros and cons of insertion sort

Answer 7

Easy to implement
Little memory used

Not very efficient

Question 8

Merge sort

Answer 8

• Split the lists into lists of size one.
• Merge each pair of sub lists by comparing the first value of each list and putting the smaller value into the new list first.
• Continue merging until there is only one list.

Question 9

Pros and Cons of Merge sorts

Answer 9

Very efficient algorithm

Can be slower for small lists
Needs additional memory