T2 - Searching algorithms

• Linear search goes through each item one by one
• A binary search involves halving the list when a middle item is found too far up or down in the chronological sorting. This is a lot faster but requires the list to be sorted