Comments on: https://www.emblogic.com/blog/07/3893/ Embedded System and ARM Training Mon, 07 Oct 2013 04:00:03 +0000 hourly 1 http://wordpress.org/?v=3.9.1 By: kpeswani https://www.emblogic.com/blog/07/3893/#comment-991 Tue, 17 Jul 2012 10:44:00 +0000 http://emblogic.org/blog/?p=3893#comment-991 since u r developing an algo try to reduce the complexity of ur algo…..in O(n)

Hint: study data structure TRIE

]]> By: Abhishek https://www.emblogic.com/blog/07/3893/#comment-977 Fri, 13 Jul 2012 06:53:59 +0000 http://emblogic.org/blog/?p=3893#comment-977 there is also a predefined function “strstr” defined in string.h

]]> By: Hitesh Dhanwani https://www.emblogic.com/blog/07/3893/#comment-973 Thu, 12 Jul 2012 18:43:46 +0000 http://emblogic.org/blog/?p=3893#comment-973 the example posted on the above comment includes white spaces which were compressed after posting .. so dont go through it

]]> By: Hitesh Dhanwani https://www.emblogic.com/blog/07/3893/#comment-972 Thu, 12 Jul 2012 18:41:07 +0000 http://emblogic.org/blog/?p=3893#comment-972 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 .

]]> By: Hitesh Dhanwani https://www.emblogic.com/blog/07/3893/#comment-970 Thu, 12 Jul 2012 18:28:11 +0000 http://emblogic.org/blog/?p=3893#comment-970 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

]]>