Description: Count ranking is based on a comparison of non-linear time sorting algorithm. Its input data Additional restrictions : 1, the importation of the linear element is a limited poset S; 2. The linear input based on the length of the table n | S | = k (S said set of elements in the total number of k), k = O (n). In these two conditions, the ranking counting for the complexity of O (n). Counting sorting algorithm is the basic idea for a given input sequence of each element x, determine the sequence x value is less than the number of elements. Once this information, it can be placed directly x to the final output the correct sequence position. For example, if the input sequence, only 17 elements in the value of x is less than the value then x can be placed directly on the output sequence of 18 pos
To Search:
- [distsort] - distribution of the program is counting
- [QUICKSORT] - prepared by the use of VC quicksort algo
- [BP-C++Bilder] - used to achieve Neural Network Builder C
- [paixu1] - Known record of sequence a [1 .. n] of t
- [countingsort] - Concentrated in a smaller scope, N month
File list (Check if you may need any files):
Download