I learned this in poker - If you shuffle the cards 7 times, replacing each card behind it with the one in front of it...It is mathematically shuffled. Well that has really no use for your problem. If you don't wanna write the algorithm yourself(that's the funnest part) you can check out the next_permutation function in algorithm.h
-"What we wish, we readily believe, and what we ourselves think, we imagine others think also."PHP Code:sadf
K i am srry i did not understand what you said. is hter tuts on alkogorithm
Sure, its called google.com
-"What we wish, we readily believe, and what we ourselves think, we imagine others think also."PHP Code:sadf
I don't mean to sound rude, but could you please proof-read your posts before you read them. I'm having a huge problem trying to understand what you're asking half the time. Secondly, I think you're getting way ahead of yourself in this program. If you don't know how to create an algorithm to sorts elements in arrays then you really don't have the nessassary knowledge to create this program. Go back to the tutorials on arrays, loops, and swap functions and learn them well, then come back to this program.
Sent from my iPadŽ
Thanks for being honest, and srry that i wroght that badly lol i was in a rush. and k kool thanks.
You could take the individual letters of both words and insert them into two seperate map<char,int> containers and then simply compare the two containers using ==.
"Owners of dogs will have noticed that, if you provide them with food and water and shelter and affection, they will think you are god. Whereas owners of cats are compelled to realize that, if you provide them with food and water and shelter and affection, they draw the conclusion that they are gods."
-Christopher Hitchens
