Assessment of Computational Complexity and Methodologies of Pattern Matching Algorithms

Abstract: Complexity Theory is a formal mathematical theory, in which we study computational problems and algorithms to solve those problems. In complexity theory we need to analyse the program in terms of the efficiency of the program, lines of the code, finding out that the program is able to find out the correct answer or output, figuring out whether one program is better than the other program. An algorithm here means the programming code through which the given problem will be solved. It is step by step procedure to perform a desired task.

Keywords: Computational theory, Complexity theory, Computational complexity theory, String matching algorithm, P and NP problem, NP complete problem