Naive string search algorithm is used if we want a string has substring init. Can be used to count the number of times the substring is appearing in main string. This post explains procedure behind naive string search algorithm with examples and implementations in various languages. What are you waiting for get a cup of coffee and go ahead.
The Linear searching algorithm is the first and easiest searching algorithms among all. The process involved in linear search is as exactly as same as how we search for a particular thing in our daily life. This post explains how linear search works and various implementations. Read further to understand it thoroughly.