Search and sorts

Question 1

linear search

Answer 1

searches each value from start to finish until item located

Question 2

binary search

Answer 2

better, only works on sorted lists
divides list into 2, compares and discards the side its not it, repeat

Question 3

bubble sort

Answer 3

compares n and n+1, swaps if nessecary, repeats until no swaps are made in a pass

Question 4

insertion sort

Answer 4

creates list of size 1, then ads unsorted list to the correct position in the new list

Question 5

Merge sort

Answer 5

seperate to individual elements, pair up in sorted order, repeat (faster, difficult to code)