Linear Search
looks through a list of items and finds if a value is in the list. It checks every item in the list and compares it to the search item
Binary Search
Works by splitting the list in two until the item is found
Name 4 advantages of linear search..
Simple to code
Quite efficient for short lists
Doesn’t requires ordered data
Helps for algorithms such as max/min
Name 1 disadvantage of linear search
Very slow on large lists
Name 1 advantage of binary search
Fast on any length of list
Name 2 disadvantages of binary search
Complex code
Data has to be ordered