The "low-tech" approach would be to go through each data set's elements, and compare them to the elements of the Search data set.
So: data set 1 **we look at 'A', and SDS has no 'A' ** now 'E', and again SDS has no 'E' ** now 'F', and ditto. Score for set 1 is 0 since it was 0 for three possible matches. In the same way, set 2 is scored as 66.6 for 2 for 3, and set 3 scored 33.3 for having 1 of 3 matches. In a parallel array (or whatever), store the results. data set 1 matches in matches[1], etc. In languages like Perl and Ruby, with built in pattern matching, it's a very small amount of code. In 'C' and such, it's a bit more keyboarding but the same result. Adak --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
