[tootypegs]

Hello, its been a long time since Ive attempted some programming and been on here so I hope you can forgive me. My question involves searching large amounts of data. I havnt started my programming yet so I'm not asking anyone to do it for me or anything I am just simply after advice on how to go about this task. I want to search through a huge list of keywords (list a) and see if any of the match the next list of keywords (list . At the finish I want to export all matches to another summary file (list c).

Im comparing a huge amount of data therefore I really need to attempt this in the most efficient way. I was thinking about putting both lists into spreadsheets and preform some type of comparison on these however Im not sure how well this is going to work. Are there any better methods of doing this such as databases and how possible is this in C++

Thanks

[Martyn.Rae]

When you say huge amounts of data, could you give us estimates - kilobytes, megabytes or gigabytes? C++ is well capable of handling all of those.

[taylorc8]

Are the lists sorted? Some algorithm wizard may know a good tactic..

[eker676]

Well I knew there was a function for this in the standard template library so I glanced at some reference:
http://cplusplus.com...t_intersection/

And bingo!

Read both sets of data into vectors, create a third vector, use the set_intersection() function and write the third vector to the file.