Automated Big-O analysis of algorithms

Abstract

Algorithm analysis is an important part of algorithm design. Traditionally, analysis of programming code or algorithms is theoretical and mathematical. This makes it a time consuming and manual process. This limits the scope and scale of undertaking such a task. There has always been an ever-growing need to automate this analysis. With mobile development taking the center stage, we need to ensure that we build programs that are efficient as this translates to better power consumption and improved battery life. We have compiled this paper after taking all the limitations around the input domain into consideration. We have developed and presented the idea, data structures and the algorithm that can accomplish the automated Big O analysis of basic programs. For our research, we have considered programs written in the Java programming language. We have illustrated the working using an example. Further, we have presented the future scope of the system. Using this anyone interested in the field can enhance and extend the system.