Searching arrays...

BlitzMax Forums/BlitzMax Beginners Area/Searching arrays...

The forum is locked. These are the original blitzbasic.com forums, kept so they can still be read. No new topics, replies or edits can be made here. To join in, head over to the Blitz3D+ forums.

hash maps are the best solution for a large number of elements.

i don't know how tMaps handle collisions...

you can also use binary trees to mantain O(log n) for search.