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 :-
http://learandexperiment.blogspot.in

Project Activity

See All Activity >

Categories

Algorithms

License

GNU General Public License version 3.0 (GPLv3)

Follow Shobhit-Improved String Search

Shobhit-Improved String Search Web Site

nel_h2
Gen AI apps are built with MongoDB Atlas Icon
Gen AI apps are built with MongoDB Atlas

The database for AI-powered applications.

MongoDB Atlas is the developer-friendly database used to build, scale, and run gen AI and LLM-powered apps—without needing a separate vector database. Atlas offers built-in vector search, global availability across 115+ regions, and flexible document modeling. Start building AI apps faster, all in one place.
Start Free
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of Shobhit-Improved String Search!

Additional Project Details

Operating Systems

BSD, Cygwin, Linux

Languages

English

Intended Audience

Developers, Education, Engineering

User Interface

Console/Terminal

Programming Language

C

Related Categories

C Algorithms

Registered

2013-08-16