Analyze the efficiency of keyword search algorithms

This paper intends to analyze, through developed software, the answer of various algorithms to keyword search in random strings problems within the constraint of time and memory space used. The program developed is able to choose, depending on the algorithm used, the maximum number of characters used to comply with data constraints. Afterwards, the performance of algorithms in operations of keyword search in random strings is analyzed. Tests were performed by generating random texts of different lengths, using different character sets. Results can be used to minimize search time, such as in the FIND function used by text editors.