Description: Programming choices, the algorithm to find the first K elements of the average amount of time small. Compare (1) n value changes (such as 5000,10000,20000) (2) input increments sequence, non-increasing sequence, random order of the above circumstances algorithm to find the first K elements of the average amount of time small
To Search:
- [smallelements.Rar] - This is the algorithm analysis and desig
- [3] - Small element of the first k search algo
- [xiugai] - I use MATLAB to do the Augmented Matrix
- [producer-consumer] - Use POSIX threads (or processes) and SYS
- [Kmin] - K for the first small element (sub-rule
File list (Check if you may need any files):
Download