searching and sorting algorithms

searching and sorting algorithms

1. Searching algorithms

   • Binary search
     • Looks for items in an ordered list.
     • The particular collection needs to be sorted before binary search can be used on in.
     • The number of iterations can be reduced on the basis of the value that is being searched.
     • much more efficient than a linear search
     • Takes fewer steps in order to find what your looking for, compared to linear.
   • Linear search
     • A linear search has the ability to be used on an unordered list.
     • Checks each item on the list in turn to see if it is the correct one.
     • If the correct one is found and it's checked every item, the process will be stopped.
     • much simpler than a binary search but less efficient.
     • Can be used on any type of list there is.

2. Sorting algorithms

   • A bubble sort
     • Compares pairs of items
     • Sorts unordered lists
     • Algorithm is very simple to understand but can often be time consuming to actually sort a list.
     • One of the simplest algorithms because it on focuses on two items rather than the whole list of items.
     • inefficient, does not cope well with large lists.
   • A merge sort
     • Splits the list apart then merges it back together
     • Small lists are easier to sort than large lists
     • Easier to merge two ordered lists than two unordered lists.
     • Much more efficient than the bubble sort.
     • Slower than other algorithms when dealing with small lists.
   • An insertion sort
     • Orders the items as it goes
     • The simplest sorting algorithm there is
     • Copes very well with small lists and very quick at checking that a list is already sorted.
     • Does not cope very well with large lists
     • Not much additional memory is required, this is because all sorting is done on the original list.