Analyzing the intricacies of McCabe's complexity over a span of four to five decades

McCabe’scyclomatic complexity is a software measurement matrix used in white box testing. It is a measurement of complexity of a program. It is also used as standard for analysis of two program codes or we can say it is a metric counts a number of arranged in straight not dependent paths through a bit of code. The purpose of the paper is to analyze cyclomatic complexity in different programs and how can we improve this in future the proposed solution is we should use Machine learning algo to calculate Mccabes cyclomatic complexity. The cyclomatic complexity is calculated using the flow chart of the code. Based on the flow chart how to find cyclomatic complexity and limitations of complexity is explained here.