- Category:
- Other systems
- Tags:
-
[Text]
- File Size:
- 1kb
- Update:
- 2013-12-24
- Downloads:
- 0 Times
- Uploaded by:
- 陈凯
Description: Integers in ascending order as an example to explain the simple process of bidirectional bubble sort: the maximum number of front to back first to the last, and then turn back to front of the smallest number of moves to the top of the array, this process is The first round, and then repeat the process, and ultimately the entire array will be lined up from small to large. Bidirectional bubble sort to be slightly superior to the traditional bubble sort, because two-way sorting two arrays are sorted Well, we only need to deal with the middle part of the array, and the way that only the tail of the traditional elements of a bubble sort is sorted, then each round of treatment requires de novo already sorted elements have been treated to an element. While it has been point improvement in efficiency, but it can not significantly improve the efficiency of its sort, which is the basic process of bubble sort of decision. Based on this improved a bit, the following code can be achieved on odd and
To Search:
File list (Check if you may need any files):
shuangxiangmaobao.txt
Download