2.1 v1

2.1 v1

1. binary search

   • searches for a variable by going to the middle value, checking wether it is equal, lesser or greater than the searched value, if is greater it goes left, if lesser, it goes right and repeats itself until it reaches the searched value
     • worst case scenario: half of the values are searched
     • has to be in order. always

2. linear search

   • searches for a variable by selecting each variable until it is equal to the searched variable
     • worst case scenario: all values are checked
     • doesent have to be in order

3. bubble sort

   • swaps variables so the items are in order

4. merge sort

   • seperates the order into smaller parts to make it easier to sort, and then merges them back together in order