in reply to Fast algorithm for 2d array queries
Problem You've spent over half your post describing your solution for a minimal version of your problem, that doesn't scale. But you haven't actually state what the problem is.
For example. You've told us that you've a 2d array of integers; that those integers range between 1 & 3e6 (twice) ; and there are ~50000 in each inner array.
But you fail to say how big the main array is?
Or what you need to look up. Ie. what do you start with; and what information do you need to end up with?
Or how many lookups you need to do?
And will you do these lookups once? Or once a week? Or once an hour?
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^2: Fast algorithm for 2d array queries
by baxy77bax (Deacon) on Feb 07, 2014 at 10:24 UTC | |
by BrowserUk (Patriarch) on Feb 07, 2014 at 11:25 UTC | |
by Anonymous Monk on Feb 07, 2014 at 12:13 UTC | |
by BrowserUk (Patriarch) on Feb 07, 2014 at 12:36 UTC | |
by Anonymous Monk on Feb 07, 2014 at 21:19 UTC | |
|