Let me rephrase my challenge.
Are you really suggesting that you can merge sort 500 to 1000 sets of 50,000 numbers, then scan the resulting 2.5 to 5 million element array to count the most frequent constituent -- in 2 milliseconds?
In reply to Re^4: Fast algorithm for 2d array queries
by BrowserUk
in thread Fast algorithm for 2d array queries
by baxy77bax
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |