Skip to content

Commit 238d692

Browse files
larsmanslarsmans
committed
ENH faster heapsort in trees
Uses the heapsort version that I'm familiar with: linear-time heapify followed by n delete-min operations. Also cache-friendlier by copying active features into a temporary array. Random forest training time on covertype: now 34.4123s before 60.1179s
1 parent 877d892 commit 238d692

File tree

4 files changed

+3667
-3516
lines changed

4 files changed

+3667
-3516
lines changed

0 commit comments

Comments
 (0)