Description: There are two strings s and t, first s1 and t1 compare s until one of the same characters si and ti, and then their characters after the comparison, if the same, then continue down such a comparison, when s a t a character si and tj characters not at the same time, it s back to the beginning of the trip the next character characters, that is si-j+ 2, t to return to the t1, continue to start the next trip comparison, repeat the process . If t compare all the characters in the End, then to match the success of this trip, this trip is the start position i-j+ 1, otherwise, the match failed.
To Search:
File list (Check if you may need any files):
StringIndex
...........\Debug
...........\StringIndex.cpp
...........\StringIndex.dsp
...........\StringIndex.dsw
...........\StringIndex.ncb
...........\StringIndex.opt
...........\StringIndex.plg
Download