Search Routines
Output
Sorting method: None
Unsorted List:
Sorted List:
Found:
Time Taken:
Linear Search
The linear search routine works by checking every list item sequentiallly until the desired is found or the end of the list is reached.
Advantages
- Easy to understand
- Easy to implement
- Performs well on small lists
- Can be used on unsorted lists
Disadvantages
- Very slow on large lists
Code Snippet (JavaScript)
Binary Search
The binary search must take in a sorted list to work. This search routine works by splitting a set of items into two and comparing the middle item against the target. If the split item is bigger than the target, all items beyond must also be larger, so they can be excluded from the search. If the split item is smaller than the target, all items below can be excluded. This recursive process is continued until the item is found or the list is 1 item in length and isn't the target.
Advantages
- Efficient on large sets of data
- Easy to implement
- Faster than linear search
Disadvantages
- The list must be sorted
Code Snippet (JavaScript)
