String searching algorithms in C

[123scope]

Can anyone give me insights on how to use a fast algorithm which can search an entire array of strings and print out the exactly matched words which matched with the input.

[donbock]

Some fast algorithms work by parsing the input into a catalog or index that can be searched must faster than the original input. Whether the increase in search speed makes up for the overhead of creating the index depends on how many substrings you're going to search for. You haven't provided enough information to make that determination.

If you are only going to search for a single substring then a simple brute-force method is adequate -- especially if you include programming and debugging time in the search-time.

[123scope]

well, my strings will be stored in a 2d array.
the ROWS represent the lines of text inputed or read by a file pointer and most of my strings will be stored in WORDS.

does this make it easier to search matching strings.

str[ROWS][WORDS]

[jkmyoung]

Still not entirely sure what you're looking for; this thread might help.

[whodgson]

Do you mean that each element of the array will contain either 1 word or 1 space and that you will nominate a target word which the program will or will not find in the array. If this is correct wouldn`t it be more useful to spell out the location of the target in the array rather than just repeat the word?

[donbock]

Do you mean something like this to hold five 132-character lines of text:

#define ROWS 5
char text[ROWS][132+1];

Is each row a null-terminated string or is it an unterminated character array?