Merging information-quite often data held in two separate files need to be merged to form a single file. the simplest way to do this is to is to copy file A into a new file C then append the data from file B to it.
link to images-http://www.teach-ict.com/as_as_computing/ocr/H447/F453/3_3_5/data_structures/miniweb_search/pg5.htm
insertion sort-this is a simple comparison sort where the sorted list is built up one item at a time. it has many advantages as it is very easy to code, performs well with small lists and is very memory effectives as it only needs one extra storage unit.
link to images-http://www.teach-ict.com/as_as_computing/ocr/H447/F453/3_3_5/data_structures/miniweb_search/pg7.htm
quicksort-developed n the 60s as an extremely fast way of sorting medium to large list. it relies heavily on recursion as one problem is that the stack can grow so much that a stack overflows.
link to images-http://www.teach-ict.com/as_as_computing/ocr/H447/F453/3_3_5/data_structures/miniweb_search/pg9.htm