sorting / solving algorithms

sorting / solving algorithms

1. bubble sorts

   • A bubble sort algorithm goes through a list of data a number of times, comparing two items that are side by side to see which is out of order. It will keep going through the list of data until all the data is sorted into order. every time the data goes through you put "pass".
   • advantages
     • its a simple algorithm that can be implemented on a computer.
     • doesn't use much memory as all the sorting id done using the original list.
   • disadvantages
     • its an effient way to sort an algorithm.
     • due to being inefficient ,the bubble doesn't cope with long lists

2. insertion sorts

   • the insertion takes each item in turn and puts it in the right place in the lest as a starting point.
   • advantages
     • the relative order of items with equal keys does not change.
     • its a very simple algorithm
   • disadvantages
     • its not as good as other sorting algorithms
     • Insertion sort is inefficient against more extensive data sets.

3. merge sorting

   • the merge sort is splitting a list apart and then magically merges it back together in the correct order.i
   • advantages
     • it has a very consistent running time regardless of how the ordered items in the original list are.
     • its more quicker and efficent than other sorting algorithms.
   • disadvantages
     • its slower than other algorithms for smaller lists.
     • it uses more memory than other sorting algorithms in other to get the other lists