Searching and Sorting

Searching and Sorting

1. Sorting

   • Bubble
     • Not Very Efficient
     • Swapping Items in List if Not in Order
     • Needs a Final Pass to Check if Sorted
     • Easy to Code
   • Merge
     • Repeatedly Splitting List in Half
     • Merging the List back Together and Sorting
     • More Efficient
     • Hard to Code
   • Insertion
     • List is split into sorted and unsorted
     • Moderately Easy to Code
     • Go over every item in list and add to correct place in sorted list
     • Not Very Efficient

2. Searching

   • Linear
     • Go over Every Item in a List
     • Inefficient
   • Binary
     • More Efficient that Linear
     • Splitting list in Half
     • Discarding Higher or Lower Section than Value Needed