Computational Thinking 2-Sorting algorithims

Question 1

Uses

Sorting algorithim

Answer 1

Used to rearrange a given array or list elements according to a comparison operator on the elements.

Question 2

Uses

Comparision operator

Answer 2

Used to decide the new order of element in the respective data structure.

Question 3

Define

Merge sort

Answer 3

A merge sort is a complex sorting algorithm, but it is also a highly efficient one.

Question 4

How does it work

Merge sort

Answer 4

1. A merge sort uses a technique called divide and conquer.
2. The list is repeatedly divided into two until all the elements are separated individually.
3. Now each pairs of elements are compared, placed into order and combined.
4. As each pair of lists is merged, they are merged in order.
5. The process is then repeated until the list is recompiled as a whole.

Question 5

How does it work

Bubble sort

Answer 5

1. Start at the beginning of the list.
2. Compare the first value in the list with the next one up. If the first value is bigger, swap the positions of the two values.
3. Move to the second value in the list. Again, compare this value with the next and swap if the value is bigger.
4. Keep going until the there are no more items to compare.
5. Go back to the start of the list

Question 6

Advantages/Disadvantages

Insertion sort

Answer 6

An insertion sort is less complex and efficient than a merge sort, but more efficient than a bubble sort.

Question 7

How does it work

Insertion sort

Answer 7

An insertion sort compares values in turn, starting with the second value in the list.
If this value is greater than the value to the left of it, no changes are made.
Otherwise this value is repeatedly moved left until it meets a value that is less than it.
The sort process then starts again with the next value.
This continues until the end of the list is reached.