Skip to Main Content
Exact string matching algorithms are essential components in practical applications of the computer system. In this research we propose a new concept to solve the problem of exact string matching by scanning text string for the rightmost character of the pattern in preprocessing phase. In matching phase TSPRC (Test Scanning for Pattern Rightmost Character) compares the pattern with text window from both directions simultaneously. Proposed algorithm implemented and compared with existing algorithms. Comparison results demonstrate that TSPRC is efficient than the number of the existing algorithm and take O(1) time complexity in the best case.