Bubble Sort
　　Bubble sort is the simplest method of sorting. Suppose there is an unordered list of n items.
Algorithm:
  1. Input n, the list is K[0],K[1],...,K[n]
  2. i=n-1
  3. do
  4.   for j=1 to i
  5.     if K[j]>K[j+1] then K[j] interchange with K[j+1]
  6.   endfor
  7. i=i-1
  8. enddo when i=0
  9. output K[0],K[1],...,K[n]
Example:
　　This is a demostration to show how to update a football league table. It is useful for sport site and online news site. Users can update the table by inputting new results. Data are stored in simple text file. Bubble sort is used to sort the table.