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.
Merge sorting is an advanced sorting algorithm which uses divide and conquer policy. Merge sorting is not an in-place sorting algorithm. Using merge sort we can improve the speed of sorting but at the cost of space. If you want to see how it is done, go ahead and try it yourself over a cup of coffee.
In my previous article about the time complexity and big o notation, I have given an overview of the procedure, rules, and simplification of the big o notation. If you are new to big o notations and time complexities I would recommend reading that coming back to this article as this article explains little advanced …