Description: Setting the recording R [i] is a keyword R [i] .KEY (1 < = i < = k), the tree node T [i] (1 < = i < = K-1) points loser record, T [0] is unbeaten record label. Corresponding to the above-described algorithm produces a write R [i] (1 < = i < = k) loser tree requires in addition R [1..k] and T [0..k-1] except using only O (1 ) auxiliary space.
To Search:
File list (Check if you may need any files):
a.cpp
Download