A tool designed to calculate the time complexity and space complexity (Big-O Notation) of a given code snippet. This project aims to assist developers in analyzing and improving the performance of their algorithms.
- Time Complexity Analysis: Identify the runtime growth of the algorithm.
- Space Complexity Analysis: Determine the memory usage growth relative to input size.
- User-Friendly Interface: Simple and intuitive design for ease of use.
- Supports Common Structures: Handles loops, recursive calls, and basic operations.