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

Other Useful Business Software
Your top-rated shield against malware and online scams | Avast Free Antivirus Icon
Your top-rated shield against malware and online scams | Avast Free Antivirus

Browse and email in peace, supported by clever AI

Our antivirus software scans for security and performance issues and helps you to fix them instantly. It also protects you in real time by analyzing unknown files before they reach your desktop PC or laptop — all for free.
Free Download
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

Cygwin, Linux, BSD

Languages

English

Intended Audience

Education, Developers, Engineering

User Interface

Console/Terminal

Programming Language

C

Related Categories

C Algorithms

Registered

2013-08-16