2.1 Algorithms Sorting

2.1 Algorithms Sorting

1. Bubble Sort

   • Works by repeatedly going through the list to be sorted, comparing each pair of adjacent elements.
   • If the elements are in the wrong order they are swapped, else they are left in position

2. Insertion Sort

   • Sorts data one element at a time.
   • The algorithm takes one data item from the list and places it in the correct location in the list
   • The process is repeated until there are no more unsorted items in the list.
   • More efficient than bubble sort

3. Merge Sort

   • This is a two-stage sort
   • Firstly the list is split in half into sub lists repeatedly.
   • The algorithm stops splitting the lists when each list has only 1 element in it
   • The second stage involves repeatedly merging the lists in the order until there is only one sub list remianing

4. work out the purpose of a given algorithm

5. explain standard methods of solution

6. understand the need for validation and verification checks to be made on input data (validation could include range checks, length checks, type checks, and check digits)

7. identify errors in given algorithms and suggest ways of removing these errors

8. produce an algorithm for a given problem (either in the form of pseudocode or flowchart)