Name | Modified | Size | Downloads / Week |
---|---|---|---|
Shobhit-Improved-String-Search-Algorithm.tgz | 2013-08-16 | 6.2 kB | |
README.txt | 2013-08-16 | 1.1 kB | |
test_app.exe | 2013-08-16 | 11.7 kB | |
Totals: 3 Items | 19.0 kB | 0 |
README Design Description: SHOBHIT-Improved String Search Algorithm is a string searching algorithm created by SHOBHIT UPADHYAYA in August 2013. 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). How To Compile "test_application": Below is the general command: tar -xzvf Shobhit-Improved-String-Algorithm.tgz cd Shobhit-Improved-String-Algorithm make cd executables ./test_app.exe Files Includes With This Project: src/sho_improved_search_api.c Implementation of the Shobhit-Improved-String-Algorithm src/test_application.c Test application to test Shobhit-Improved-String-Algorithm api include/sho_improved_search_api.h Header file that contains the defination of search api Makefile This contains the compilation rules