// Linear search checks each item; binary search halves sorted data
Linear search checks each item in order and works on any list. Binary search needs sorted data: it checks the middle and throws away half each time, so it needs far fewer checks on a long list.