Jump to content
  • Advertisement
Sign in to follow this  

Searching Algorithm on Matrix Type Data

This topic is 1956 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

I would like to implement an efficient algorithm to search data as part of the following format.


|X|Y|100 character length string|


All columns are non-unique. Which means you can have


|5.5|23.4|SOME TEXT|

|10.1|12.2|SOME TEXT|

|10.1|10.1|MORE TEXT|



An example of a query would be :


- FindText("SOME*") /*Returns all rows with this text */

- FindX(10.1)

- FindY(10.1)




Will a simple array suffice or is their an algorithm more efficient I should  read about? 

Edited by Instigator

Share this post

Link to post
Share on other sites

You can keep the data in an array and then have auxiliary data structures to be used as indices, which would map values of a column to indexes to the main array. If you are using C++, std::unordered_multimap is a good way to do this.


If you are never going to remove data, this is really simple.

Edited by Álvaro

Share this post

Link to post
Share on other sites
Sign in to follow this  

  • Advertisement

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!