Re: String compare
- From: Muhs <shumyl21@xxxxxxxxx>
- Date: Wed, 12 Mar 2008 10:06:44 -0700 (PDT)
lol.. i know what u mean by being it a homework... its not exactly a
homework..
its my degree project which i'll be working on till september... and
ive just stated.. My project is about mutation clustering...the data
that i have is in the form of 1's and 0's
(10001010101010101010000011... could be int or string). And i have to
cluster them based on the hamming distance...
I was just thinking of ways to compare and cluster the data... (i
thought i could compare the each string and getthe number of different
bits)
or i can XOR each int and find the distance...
somebody in the reply above sent a link... and i found this hamming
distance algo:
int dist = 0;
int val = 0;
int x= 8;
int y=15;
val = x ^ y; // this will be equal to 7
while(val!=0)
{
++dist;
val = val - 1;
}
but this
On 12 Mar, 16:43, Martin Bonner <martinfro...@xxxxxxxxxxx> wrote:
On Mar 12, 4:20 pm, Muhs <shumy...@xxxxxxxxx> wrote:
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??
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.)
.
- References:
- String compare
- From: Muhs
- Re: String compare
- From: Martin Bonner
- String compare
- Prev by Date: Re: SQL Statement In to SQL
- Next by Date: Re: String compare
- Previous by thread: Re: String compare
- Next by thread: Re: String compare
- Index(es):
Relevant Pages
|
Loading