5 Responses to

1. Hitesh Dhanwani says:

   July 12, 2012 at 11:58 pm

   There are various ways of string matching …
   one of them is (which i implemented in my program) :

   e.g. “the algorithm of the program is here”
   suppose we have to find number of occurences of “the”
   1.match the char of “the” with the first char of entered string
   ‘t’ matches
   2. if it matches den match the second char

   Reply
2. Hitesh Dhanwani says:

   July 13, 2012 at 12:11 am

   3. in case it doesnt then match the first char of short string with second char of string ..
   nd whenever the total no of consecutive matches is equal to the length of short string.you have got a match . juhst to give u an idea :

   E.g long string : “i am a programmer”
   e.g. short string : “programmer”

   now match the first char
   i am a programmer
   |
   p

   doesnt matches move to the right in long string

   i am a programmer
   |
   p

   doesnt match move right

   keep moving till ur first char of short string matches
   u’ll reach a stage like this

   i am a programmer
   |
   p matched character = 1

   i am a programmer
   ||
   pr matched character = 2

   i am a programmer
   |||
   pro matched character =3

   similarly

   i am a programmer
   ||||||||||
   programmer
   matched character = 10 =length of the short string . now you have got ur first short string in the long string .. which is the only one in this case .. keep shifting throughout the length of the short string or to optimize your program you can shift till

   (length of the long string – length of the short string)

   Note:there are other string matching algorithms as well .. u might have studied it in Design and analysis of algorithm if you are a CSE student .

   keep commenting if you find any problem .

   Reply
3. Hitesh Dhanwani says:

   July 13, 2012 at 12:13 am

   the example posted on the above comment includes white spaces which were compressed after posting .. so dont go through it

   Reply
4. Abhishek says:

   July 13, 2012 at 12:23 pm

   there is also a predefined function “strstr” defined in string.h

   Reply
5. kpeswani says:

   July 17, 2012 at 4:14 pm

   since u r developing an algo try to reduce the complexity of ur algo…..in O(n)

   Hint: study data structure TRIE

   Reply