working with char

k i will tell you the part i can't get and will not explain the whole thing.
Anyways i need someway to get the c++ program to see "what" same as "hwat" so i want to rearange it i got the enlish but now i just need to compare them.
I though that if i add w+h+a+t it would be the same as h+w+a+t but it is not it game me two diffirent number.
"I thought that each letter has same value."
Thanks let me know if it is to confusing.

what makes you think the sum of the two strings are not the same?

Code:

---

#include <iostream>
#include <string>
using namespace std;

int main()
{
        string s1 = "hwat";
        string s2 = "what";
        int i1 = 0, i2 = 0;
        int i;
        for(i = 0; i < s1.size(); i++)
                i1 += s1[i];
        for(i = 0; i < s2.size(); i++)
                i2 += s2[i];

        cout << "i1: " << i1 << " i2: " << i2 << endl;

        return 0;
}

---

I'm really not sure what you're trying to say. If you're asking how to compare a word to user input and consider them the same word if there is only a minor misspelling, then I have to ask a few questions before I can really give you an idea of what to do. First, what do you mean "get the program to see?" Are you talking about user input that the program will have to compare to a literal constant in the program? If this is the case, then I'll ask how long is this constant. Because if it's only four letters like what, then I would just use the "or" operator to compare to all the misspellings, if it's a long string, then it's more difficult and I'll get to that in a reply.

no i am doing this challange that is scrambeled words and u have to get to normal and i got everything set up. I got it to see if it the same number of letters then see if it is the same letters in it. if so that means there is a chance i found unscrambeled word.

you could sort all the letters in ascending (or descending) order, then compare the two strings. That does not mean the two original strings are the same, it only means that the two strings contain the same letters.

Why don't you just check to see if it's the exact same word?

For instance you supply : gmigrpmoarn
They have a chance to answer.
If what they input is "Programming" they win. If it isn't, they guess again. I don't see why you need to first check if it contains the same letters.

accient hit it right in the spot now i need a good english txt file taht has no spaces cause i am tired of same word like 100 times and why does it make "hwat" and it says "salt" has same number.

So now you've rearranged the user's string to an incorrect order and can check to see if all the letters are the same? How do you know check to see if they got the word correct because their input is now not what their input was.

As AD said...

Quote:

---

Originally Posted by Ancient Dragon

That does not mean the two original strings are the same, it only means that the two strings contain the same letters.

---

Quote:

---

and why does it make "hwat" and it says "salt" has same number.

---

because the sum of their individual letters are the same Here is the output when s1 = "hwat" and s2 = "salt". You should experiment yourself to see why they are the same.

Code:

---

i1: 104 119 97 116
i2: 115 97 108 116
i1: 436 i2: 436
Press any key to continue

---

Thanks guys i am not spell chekcing i am rearanging a word like a puzzle and how can i over come that salt and hwat problem can i assing diffirent number to each of the letters will that fix it. thanks

while i sit and cry here..... :confused:
and saying ""o plz"

assigning different numbers will not fix it, every letter already has a unique number. You might investigate hash algorithms -- boost libraries has one (or more), but I've never used them. google for "c++ has algorithms" and you will find more information. I don't know if they will help you with your problem or not. But just simple addition of the individual characters is not sufficient to obtain a unique numeric value for any given word.

hmm anyother ideas?
lol i am out.
the only thing i can think of is getting a string and see if there is other same letter and doing it with each one. by useing the value.

you'll have to rearrange the letters in every possible order until the strings match(if they do). The algorithm isn't that hard to figure out and you can use _stricmp() to test each possibility.

k any good tutorials on rearanging the strings

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

K i am srry i did not understand what you said. is hter tuts on alkogorithm

Sure, its called google.com

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.

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 ==.