Tek-Tips is the largest IT community on the Internet today!
Members share and learn making Tek-Tips Forums the best source of peer-reviewed technical information on the Internet!
-
Congratulations IamaSherpa on being selected by the Tek-Tips community for having the most helpful posts in the forums last week. Way to Go!
-
need with arrays
I solved the problem. Thanks a lot guys! [smile2]- DonFredi
- Post #9
- Forum: Microsoft: Visual C++
-
need with arrays
yea, it at table[pattern[j]]= num-1-j. I think the problem is that pattern[j] return an index of type char and table is of type int. Any suggestions on other ways of accomplishing this?- DonFredi
- Post #5
- Forum: Microsoft: Visual C++
-
need with arrays
Thanks HyperEngineer!!! Corrections: pattern always contains num < 10; int table[10]; num is the number of char in pattern void shiftTable(char* pattern, int num){ int i; num= strlen(pattern); for(i=0;i<10;i++) table[i]=num; for(int j=0; j<num; j++)...- DonFredi
- Post #3
- Forum: Microsoft: Visual C++
-
need with arrays
Hi all! I am trying to implement the Boyer Moore Horspool algorithm and having trouble with the following function: void shiftTable(char* pat, int num){ int i; num= strlen(pat); for(i=0;i<10;i++) table[i]=num; for(int j=0; j<pNum; j++) table[pat[j]]=num-(1+j);// int table[10] } what I...- DonFredi
- Thread
- Replies: 8
- Forum: Microsoft: Visual C++
