In Computer Science, SHOBHIT-Improved String Search Algorithm is a string searching algorithm created by SHOBHIT UPADHYAYA in August, 2013. He is working as a Software Developer in Bangalore India.
“This algorithm uses the first, last, mid1 and mid2 index of the substring for a pattern search.”
TIME and SPACE Complexity:
For a text of length n and substring of length m.
Its best case, time complexity is O(m/4) and in worst case, time complexity is O(n – (m/4) ).
In all the cases best, average and worst its space complexity is O(1).
For more information please visit the following link :-
Be the first to post a review of Shobhit-Improved String Search!