Re: Microsoft Interview Questions
 From: "stdazi@xxxxxxxxx" <stdazi@xxxxxxxxx>
 Date: 20 Jan 2007 07:16:17 0800
Q2) What is an efficient way to determine whether a string is a
permutation of another string? What is your run time?
damn i forgot.. another method would be to use XOR and apply it to some
integer for each char of the two strings (presuming that the char value
can be casted to an integer tipe...) like that :
4 int isperm(char *s1, char *s2) {
5
6 int retval = 0;
7
8 while (*s1  *s2) {
9 retval ^= *s1 ^ *s2 ;
10 ++s1; ++s2;
11 }
12 return retval  (*s1 != *s2);
13 }
this is a O(n) algorithm where n is the lenght of the "shortest" string.
.
 FollowUps:
 Re: Microsoft Interview Questions
 From: Patricia Shanahan
 Re: Microsoft Interview Questions
 References:
 Microsoft Interview Questions
 From: kool_guy
 Microsoft Interview Questions
 Prev by Date: Re: Microsoft Interview Questions
 Next by Date: Re: Microsoft Interview Questions
 Previous by thread: Re: Microsoft Interview Questions
 Next by thread: Re: Microsoft Interview Questions
 Index(es):
Relevant Pages
