Description: optimal merging given K platoons good sequence of sequence s1, s2 ,..., sk. using 2-way merger of this algorithm k sequence into a series. Assumptions used by the two merging algorithm along with two others for the length m and n the sequence needs m n-1 comparisons. Algorithm design a test to determine the sequence of the merger combined the optimal sequence, and allows comparison of the total number at least.
- [biggestproductproblems.Rar] - / k* Product of the biggest problems Des
- [mathmodel] - This a good model to study the informati
- [EMD_HHT] - part of Hilbert-Huang Transformation (HH
- [0-1beibao] - 0-1 knapsack problem using the optimal s
- [permrank] - The algorithm realizes the dictionary or
- [devide] - Optimal decomposition of the problem gre
- [4_9] - Automobile refueling problems, Wang Xiao
- [026634-01] - Algorithm courseware documents, on the g
- [jiayouzhanwenti] - Fill up the car after driving an n km. T
File list (Check if you may need any files):
Download