Occurrences Algorithm for String Searching Based on Brute-force Algorithm

Abstract

String searching is a very important component of many problems, including text editing, text searching and symbol manipulation. In this paper a string searching algorithm is proposed as an improvement of the brute-force searching algorithm. The algorithm is named Start-End-Mid Algorithm. The proposed algorithm does not preprocess neither the pattern nor the text to perform searching.