Hi Guys, Here is my situation.
The set of room types available is [s, d, t]. A user specifies the number of rooms required [n] and I have to generate a list of permutations. So where n=3 we get [sss, ssd, sst, sdt, std, etc] The problem I have is that sdt and std really are the same. How can I get an efficient list of permutations but without duplicates? Cheers Pete --~--~---------~--~----~------------~-------~--~----~ 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 algogeeks+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
