DownloadIn 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 :-
http://learandexperiment.blogspot.in
Categories
AlgorithmsLicense
GNU General Public License version 3.0 (GPLv3)
You Might Also Like
Our Free Plans just got better! | Auth0 by Okta
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your secuirty. Auth0 now, thank yourself later.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Shobhit-Improved String Search!