- Category:
- CSharp
- Tags:
-
[C/C++]
[源码]
- File Size:
- 1kb
- Update:
- 2013-01-17
- Downloads:
- 0 Times
- Uploaded by:
- hac
Description: On the sequence table fast sorting algorithm, how to select a critical value (also known as the axis elements) affect the efficiency of the quick sort, and the critical value is not necessarily an element in the sequence table. For example, we can use the average of all of the elements in the sequence is divided as a boundary value. Write algorithms to achieve the quicksort method to the average for the sector.
To Search:
File list (Check if you may need any files):
选做1.cpp
Download