Ohne Titel

Seite 1

Bubble Sort

Easy sorting Algorithm

How it works:

Take any item from the unsorted part of the list

Compare it to each item in the already-sorted part of the list

If the item is found to be in-between the values of two existing sorted items, then insert it between the two items.

Repeat the process until all the items have been sorted.

Advanatges:

Good performance on small lists

Memory Efficient - Only needs two storage locations, one for original list, one for sorted list

Good with sequential data that is being read in one at a time e.g. tape, hard disk or data

Disadvanatges:

Not as quick as merge or quick sort

bad performance with large list

Seite 2

Insertion Sort

Divides the list into two parts, sorted and unsorted.

Elements inserted one by one into correct position in sorted section.

Advantages:

Good performance on small lists

Memory Efficient - Only needs two storage locations, one for original list, one for sorted list

Good with sequential data that is being read in one at a time e.g. tape, hard disk or data

Disadvanatages:

Poor performance with large lists.

Not as quick as merge sort or quicksort

Seite 3

Merge Sort