Description: Bubble sort is a sorting method of the computer, its time complexity is O (n ^ 2), though not as heapsort, quicksort O (nlogn, base 2), but has two advantages: 1 . " programming complexity" is very low, it is easy to write code 2 with stability, where stability is the primary sequence of elements in the same relative order remains the sorted sequence, and heap sort, quick sort are does not have stability. However, all the way, Road merge sort, binary tree sort of uneven pace faster than bubble sort, and with stability, but the speed is less than heap sort, quick sort.
To Search:
File list (Check if you may need any files):
bottomupsort\bottomupsort.cpp
............\bottomupsort.dsp
............\bottomupsort.dsw
............\bottomupsort.ncb
............\bottomupsort.opt
............\bottomupsort.plg
............\Debug\bottomupsort.exe
............\.....\bottomupsort.obj
............\.....\bottomupsort.opt
............\.....\bottomupsort.pdb
............\.....\vc60.pdb
............\Debug
bottomupsort
Download