This is the Linux app named New String Search Algorithm whose latest release can be downloaded as New_String_Search_Algorithm.zip. It can be run online in the free hosting provider OnWorks for workstations.
Download and run online this app named New String Search Algorithm with OnWorks for free.
Follow these instructions in order to run this app:
- 1. Downloaded this application in your PC.
- 2. Enter in our file manager https://www.onworks.net/myfiles.php?username=XXXXX with the username that you want.
- 3. Upload this application in such filemanager.
- 4. Start the OnWorks Linux online or Windows online emulator or MACOS online emulator from this website.
- 5. From the OnWorks Linux OS you have just started, goto our file manager https://www.onworks.net/myfiles.php?username=XXXXX with the username that you want.
- 6. Download the application, install it and run it.
SCREENSHOTS
Ad
New String Search Algorithm
DESCRIPTION
New String Search Algorithm.
License:
----------
All programs/software given in this project are released under APACHE LICENSE, VERSION 2.0.
The license details can be found here: https://www.apache.org/licenses/LICENSE-2.0.
Some parts of this license are:
* Subject to the terms and conditions of this License, each Contributor hereby
grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free,
irrevocable copyright license to reproduce, prepare Derivative Works of,
publicly display, publicly perform, sublicense, and distribute the Work and
such Derivative Works in Source or Object form.
* You may reproduce and distribute copies of the Work or Derivative Works thereof
in any medium, with or without modifications, and in Source or Object form.
Features
- New String Search Algorithm: I have invented a new search string algorithm. I call it "Choudhary Algorithm". I wrote a Java program to compare my algorithm with other standard algorithms, namely - Brute Force, Boyer Moore, Rabin Karp, and Knuth Morris Pratt. If the substring (pattern) length is between 1 and 32, then my algorithm is the fastest most of the times. If the substring (pattern) length is between 33 and 128, then Boyer Moore algorithm is the fastest most of the times. But my algorithm is slower than Boyer Moore for only around 3% of times in this case. If the substring (pattern) length is between 129 and 1024, then my algorithm is the fastest most of the times.
This is an application that can also be fetched from https://sourceforge.net/projects/new-string-search-algorithm/. It has been hosted in OnWorks in order to be run online in an easiest way from one of our free Operative Systems.
