String compare

>Hi !!
>i want to compare two strings and return the difference
>
>For example, i have two strings,
>string str1="then";
>string str2="than";
>
>it compared the two strings and returns 1, as only one character is
>different (a and e).
>Is there a function in c# that can do this??

Hi !!
i want to compare two strings and return the difference
>
For example, i have two strings,
string str1="then";
string str2="than";
>
it compared the two strings and returns 1, as only one character is
different (a and e).
Is there a function in c# that can do this??

On Mar 12, 4:20 pm, Muhs <shumy...@gmail.comwrote:
>>>>
I don't think so.
>
This is quite easy, so I suspect it is homework. *You won't learn if
you get somebody else to write the code for you. *If you have written
some code and are having trouble, then post it with a description of
the problem and we can probably help.
>
If it is not homework, then what is the application? *(I can think of
a number of issues with the specification as it stands, and the
resolution will depend on the application.)

On Mar 12, 4:20 pm, Muhs <shumy...@gmail.comwrote:
>>>>
I don't think so.
>
This is quite easy, so I suspect it is homework. *You won't learn if
you get somebody else to write the code for you. *If you have written
some code and are having trouble, then post it with a description of
the problem and we can probably help.
>
If it is not homework, then what is the application? *(I can think of
a number of issues with the specification as it stands, and the
resolution will depend on the application.)

On Mar 12, 4:20 pm, Muhs <shumy...@gmail.comwrote:
>>>>
I don't think so.
>
This is quite easy, so I suspect it is homework. *You won't learn if
you get somebody else to write the code for you. *If you have written
some code and are having trouble, then post it with a description of
the problem and we can probably help.
>
If it is not homework, then what is the application? *(I can think of
a number of issues with the specification as it stands, and the
resolution will depend on the application.)

lol.. i know what you mean by being it a homework... actually its my
final year degree project.. on which i'll be working on till
sepetember... my project is about mutation clustering... and i have
data in the form of 1's and 0's(data= 101010000011000001, could be int
or string)... now i want to cluster the data based on some similarity
measure.... i thought i could compare the string data and find the
number of characters that are different... but somebody above sent a
link and there was this algo of hamming distance... i wrote the algo
as follows:
>
int distance = 0;
int val = 0;
int x= 8;
int y=15;
val = x ^ y;
>
while(val!=0)
{
++distance;
val = val - 1;
}
but the distance that i get is 7, same as val... i was thinking of
converting 7 to binary and count the number of 1's (111) that way i
could get distance 3..

>
>
On 12 Mar, 16:43, Martin Bonner <martinfro...@yahoo.co.ukwrote:
>>>>>>>