Advancements in String-Searching Algorithms Fastrack-StringSearch: A Novel Approach

String matching plays a crucial role in applications, such involving retrieval of information, data mining, natural language processing, and biology with computation. However, existing string-matching algorithms, including the Naïve Method, KMP Algorithm, Rabin-Karp Algorithm, and Suffix Array, often suffer from limitations in terms of time complexity or space complexity. Considering these shortcomings, this paper presents a novel string-searching algorithm that harnesses Merge sort and binary search techniques to optimize time complexity, while maintaining the same space complexity as traditional approaches. Drawing on compiler analysis, the proposed algorithm demonstrates a major improvement in computational time, The proposed algorithm demonstrates a major improvement in time complexity, outperforming sophisticated methods by up to 50% in the best-case scenario and matches the other algorithms in terms of speed in the worst case scenario. This advancement makes the proposed algorithm -Fastrack-StringSearch-suited for large-scale text processing.