in case of sets of sets of word we need to tokenize each set of word . use for(int i=0;(a[i]!='\0')||(a[i]=='\b');i++) int a+=a[i]; once tokenize we need to appedn them in a vector just line we use the type as string .we need to use the brute force for it.
On Sat, Sep 6, 2008 at 6:03 PM, Dave <[EMAIL PROTECTED]> wrote: > > This is not a very general algorithm. For example, how would you use > it to find the intersection of two sets of words? > > Dave > > On Sep 6, 3:50 am, sharad kumar <[EMAIL PROTECTED]> wrote: > > in order t ofind intersection of 2 sets just > > use counting principle of finding the the of times each element > > ocucurs in each set .then we find check if 2 sets have a aprticular no > > same times then we include it in the new set . > > in case of union we use principle of merge sort in additon to this > > above principle. > > that is apart from commmon nos. we have to inlcude the other nos > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
