2.1 algorithms

2.1 algorithms

1. sorting

   • 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 that are swapped, else they are left in position
   • insertion sort
     • sorts one element at a time. the algorithm takes one data item from the list and places it in the correct location in the list . this process is repeated until there are no more unsorted items in the list. more efficient than bubble sort
   • merge sort
     • this is a two stage sort. firstly the list is split in half into sub lists repeatedly. the algorithm stops splitting the list when each list has only one element in it. the second stage involves repeatedly merging the lists in order until there is only one sub list remaining

2. flow diagrams

   • terminator - start or stop
   • process - sorting and manipulating data
   • decision - a question with yes or no
   • input / output - either input some data or output it