{"id":6856,"date":"2025-03-08T00:02:07","date_gmt":"2025-03-08T08:02:07","guid":{"rendered":"https:\/\/c-for-dummies.com\/blog\/?p=6856"},"modified":"2025-03-01T11:37:29","modified_gmt":"2025-03-01T19:37:29","slug":"keep-finding-that-string-solution","status":"publish","type":"post","link":"https:\/\/c-for-dummies.com\/blog\/?p=6856","title":{"rendered":"Keep Finding That String – Solution"},"content":{"rendered":"

The task for this month’s Exercise<\/a> is to repeatedly call the strstr(<\/em>) function, locating all instances of one string (“needle”) inside another (“haystack”). Obviously your first task, which also helps with the solution, is to perform error checking on the return value from the strstr()<\/em> function.
\n
\nThe strstr()<\/em> function returns the location (pointer offset) of one string found within another. It returns NULL when the string isn’t found, which also works when you repeatedly call the function to continue searching.<\/p>\n

My solution uses a do-while<\/em> loop to find all instances in string phrase[]<\/code> of string find[]<\/code>. It also uses pointer found<\/code> to assist with the repetition:<\/p>\n

2025_03-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    if( found==NULL )\r\n        printf(\"String '%s' not found\\n\",find);\r\n    else\r\n    {\r\n        printf(\"Found '%s' at offset %d.\\n\", find, (int)(found-phrase));\r\n        do\r\n        {\r\n            found = strstr(found+1,find);\r\n            if( found != NULL )\r\n                printf(\"Found '%s' at offset %d.\\n\", find, (int)(found-phrase));\r\n        }\r\n        while( found != NULL );\r\n    }\r\n\r\n    return 0;\r\n}<\/pre>\n
The first statement to use strstr()<\/em> is outside the do-while<\/em> loop. This location is necessary to initialize variable found<\/code>. Further, if the function returns NULL, the string find[]<\/code> isn’t located in string phrase[]<\/code>, which means that further searching is pointless.<\/p>\n
After the first string find[]<\/code> is located, variable found<\/code> is used inside the do-while<\/em> loop to continue looking for matches. The key here is to start the search at the first character after<\/em> the location stored in variable found<\/code>:<\/p>\n
found = strstr(found+1,find);<\/code><\/p>\n
If you forget the found+1<\/code> expression, the function repeatedly finds the same string.<\/p>\n
Upon success, the offset is output and the loop continues until found<\/code> is equal to NULL.<\/p>\n
Here is a sample run:<\/p>\n
Was 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>\n
And, as I wrote in the original post, if you modify string find[]<\/code> to represent only “th”, the following output is generated:<\/p>\n
Was 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
I hope that your solution met with success! Remember, multiple approaches are possible for any C language puzzle. Some are more elegant than others, some obfuscated, some down right ugly. If it works, you passed the challenge.<\/p>\n","protected":false},"excerpt":{"rendered":"
The task for this month’s Exercise is to repeatedly call the strstr() function, locating all instances of one string (“needle”) inside another (“haystack”). Obviously your first task, which also helps with the solution, is to perform error checking on the … Continue reading →<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5],"tags":[],"class_list":["post-6856","post","type-post","status-publish","format-standard","hentry","category-solution"],"_links":{"self":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/6856","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=6856"}],"version-history":[{"count":3,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/6856\/revisions"}],"predecessor-version":[{"id":6866,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/6856\/revisions\/6866"}],"wp:attachment":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=6856"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=6856"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=6856"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}