/*冒泡排序-----从大到小

*前一个和后一个两两比较，若小于则交换，直到最后一个元素，即小的冒泡，大的下沉

*每一循环都会从待排序的数中找出一个最小值，排到这组数据的最末端或首段，即冒泡

*对于n个数冒泡排序的最大趟数是n - 1,每一趟排序都会在这组待排序的数中产生一个最小值，

*/-/* Bubble sort----- from largest to smallest* before and after a twenty-two, if less than the exchange until the last element that bubbling large sink* each cycle will find a minimum from the number to be sorted and routed to the very end of this set of data or the first paragraph, that bubbling* bubble sort n numbers trip number n- 1, and trips to the sort will be in generating a minimum of the number of this group to be sorted,* /