3 ms·
The simple algorithm as is uses sorting, hence nlogn -- scales reasonably well into thousands of examples.. a tree would be klogn -- minor improvement unless n
by mck- 13y ago
The simple algorithm as is uses sorting, hence nlogn -- scales reasonably well into thousands of examples.. a tree would be klogn -- minor improvement unless n >> k?