Order Of Complexity Calculator uses a new code tracer algorithm implemented in Java, which utilizes the stacks data structure. The algorithm stores code blocks in a stack and analyzes the complexity of each block and nested block, using the rules of Big-O complexity.
The algorithm takes a Python file as input and calculates the total complexity of the file, providing valuable insights into the efficiency and performance of the code. By analyzing the complexity of the code, developers can identify areas that require optimization and improve the overall quality of their software.
Implementation of the stacks data structure in Java ensures a robust and efficient algorithm that can handle large code files with ease. We believe that our code tracer algorithm is a valuable tool for developers and can greatly enhance the quality and performance of their code.
Use the package manager git clone to install Order of Complexity Calculator.
git clone https://github.com/ritessshhh/OrderOfComplexity- Get the program using above steps.
- Run the main method inside PythonTracer.java
- Make sure the file you want to trace is in the directory.
- Enter the name of the python file which you want to trace.
Please enter a file name (or 'quit' to quit): Copyright [2022] [Ritesh Chavan]
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.