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!

Register Log in
  • Congratulations SkipVought on being selected by the Tek-Tips community for having the most helpful posts in the forums last week. Way to Go!

Search results for query: *

  1. DonFredi

    need with arrays

    I solved the problem. Thanks a lot guys! [smile2]
  2. DonFredi

    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?
  3. DonFredi

    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++)...
  4. DonFredi

    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...

Part and Inventory Search

Back
Top