One of the most clever string functions is strstr()<\/em>, which searches for one string within another. Because of its return value — a char<\/em> pointer — it’s possible to call this function multiple times to continue searching through the string. By the way, finding needles in a haystack has nothing to do with sewing needles. The old phrase refers to pine needles. Hay is food for horses. Pine needles are not. A modern comparison would be finding a twig in your spaghetti.<\/p><\/blockquote>\n From that ancient Lesson in 2014, I’ve created the following code for you to use as a base for this month’s Exercise:<\/p>\n This code searches for the word The offset is calculated as the difference between the location returned from the strstr()<\/em> function and the base of the The code doesn’t do any error-checking. When the strstr()<\/em> function is unable to find a string, it returns NULL. That’s beside the point.<\/p>\n Your challenge is to modify the code presented to have the strstr()<\/em> function continue to search the given string. Remember, the value the function returns is an offset (pointer) into the string where the first match is found. It’s possible to call the function a second time to continue the search. Here’s output from my solution:<\/p>\n If I modify my solution to search for only the letter combination “th”, I see the following output:<\/p>\n Please try this exercise on your own before you check out my solution<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":" Difficulty: ★ ★ ☆ ☆ One of the most clever string functions is strstr(), which searches for one string within another. Because of its return value — a char pointer — it’s possible to call this function multiple times to … Continue reading
\n
\nI first wrote about the strstr()<\/em> function back in 2014<\/a>. I also demonstrated (with lovely illustrations) how to call the function a second time in a follow-up post<\/a>. But I left it at that. Now it’s time to pick up the slack and use the strstr()<\/em> function to find all instances of needles in a haystack.<\/p>\n2025_03_01-Exercise.c<\/a><\/h3>\n
\r\n#include <stdio.h>\r\n#include <string.h>\r\n\r\nint main()\r\n{\r\n char phrase[] = \"Was this the face that launch'd a thousand ships, and burnt the topless towers of Ilium?\";\r\n char find[] = \"the\";\r\n char *found;\r\n\r\n puts(phrase);\r\n found = strstr(phrase,find);\r\n printf(\"Found '%s' at offset %d.\\n\",\r\n find,\r\n (int)(found-phrase)\r\n );\r\n\r\n return 0;\r\n}<\/pre>\n\"the\"<\/code> in the phrase[]<\/code> array. It finds it only once, reporting the word and its offset. Here’s a sample run:<\/p>\nWas this the face that launch'd a thousand ships, and burnt the topless towers of Ilium?
\nFound 'the' at offset 9.<\/code><\/p>\nphrase[]<\/code> array, found-phrase<\/code>. This value is typecast to an integer for output as the offset in characters.<\/p>\nWas this the face that launch'd a thousand ships, and burnt the topless towers of Ilium?
\nFound 'the' at offset 9.
\nFound 'the' at offset 60.<\/code><\/p>\nWas this the face that launch'd a thousand ships, and burnt the topless towers of Ilium?
\nFound 'th' at offset 4.
\nFound 'th' at offset 9.
\nFound 'th' at offset 18.
\nFound 'th' at offset 34.
\nFound 'th' at offset 60.<\/code><\/p>\n