standard algorithms

standard algorithms

1. Bubble sort

   • Advantagtes
     • Hardly any extra memory is needed to temporarily hold data during sorts.
     • Very few lines are required to make this code so it is easy to program
   • Disadvantages
     • This is unsuitable for large data sets, which will take a long time to sort
     • Processor time is used inefficiently as some of the data items are examined twice

2. Quick Sort

   • Advantages
     • quick sort is a lot faster and more efficient than bubble sort hence the name "quick sort"
   • Disadvantages
     • If the data it is rearranging is almost in the correct order or in reverse order then it loses its efficiency and doesnt take advantage of it.
     • The coding involved with making wuick sort is more complicated and harder to understand than the bubble sort

3. Selection sort

   • Advantages
     • Barely any memory is needed while the numbers are temporarily held during sorts
     • The code is easy to understand and very few lines of code are needed for it
   • Disadvantages
     • The way it uses the processor is quite inefficient because if the data is already close to being in order or is in reverse order then it wont take advantage of that
     • Using large amounts of data it is inefficient and will take a long time compared to quick sort

Bilder und Dateien der Mindmap