Sequential Searching

Sequential Searching

1. Works on unordered and ordered collections

2. If list is not sorted, sequential is more efficient

3. Unordered

   • Get key
   • Start from beginning of list
   • Traverse through list
   • Stop when you found key or reached end of list

4. Ordered

   • Get key
   • Start from beginning of list
   • Traverse through list
   • Stop when:
     • Found key
     • Element > key
     • Reached end