2.1 algorithms

Question 1

pros+cons of bubble sort

Answer 1

-efficient for small datasets
-easy to implement
~inefficient on large sets

Question 2

pros+cons of insertion sort

Answer 2

-efficient on sorted sets
-easy to implement
~inefficient on randomly arranged datasets

Question 3

pros+cons of merge

Answer 3

-efficient
~complex to implement

Question 4

pros+cons of linear

Answer 4

-easy to implement
~inefficient
~slow

Question 5

pros+cons of binary

Answer 5

-efficient
~needs to be ordered

Question 6

how to perform a binary search

Answer 6

-order list
-add positions starting from 0
-find midpoint (highest-lowest)
-if target found, end and state this
-if lower than target, <= mid discarded
-if higher than target >= mid discarded
-explain the above steps
-repeat until found

Question 7

how to perform linear search

Answer 7

-add positions from 0
-compare to target and state if found end program and state
-if not found increment position by 1
-repeat until found

Question 8

insertion sort

Answer 8

-2 lists
-1 unordered, 1 ordered

Question 9

merge sort

Answer 9

-divided 8,4,2,1
-2 ordered
-4 ordered
-8 ordered

Question 10

bubble sort

Answer 10

-compares the adjacent values