| Home |
| Search |
| Today's Posts |
|
#1
Posted to microsoft.public.excel.programming
|
|||
|
|||
Any way to do this faster?
For simplicity I say I have 2 1-based 1-D arrays, both holding integer
numbers. Both arrays are sorted ascending. Would there be any faster way to determine that both arrays have no numbers in common other than with a double loop? As these arrays can be big (thousands) this could take a minute or so. I don't know C++ or Assembly, but that are the kind of things I am thinking of. Thanks for any advice. RBS |
| Thread Tools | Search this Thread |
| Display Modes | |
|
|
Similar Threads
|
||||
| Thread | Forum | |||
| can this be done faster? | Excel Discussion (Misc queries) | |||
| Faster way to do this? | Excel Programming | |||
| Can faster CPU+larger/faster RAM significantly speed up recalulati | Excel Discussion (Misc queries) | |||
| Is there a faster way | Excel Programming | |||
| Which one is faster? | Excel Programming | |||
Threaded Mode
