{"id":23463741,"url":"https://github.com/abhinav2712/timecomplexitycalculator","last_synced_at":"2026-05-09T19:34:24.185Z","repository":{"id":236664977,"uuid":"650518072","full_name":"abhinav2712/TimeComplexityCalculator","owner":"abhinav2712","description":"Time Complexity Calculator: Estimate the time complexity of your program using Big O notation.","archived":false,"fork":false,"pushed_at":"2023-06-07T08:58:54.000Z","size":177,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-04-12T13:15:49.237Z","etag":null,"topics":["app","big-o-notation","performance","react","react-app","time","time-complexity-analysis","typescript","web"],"latest_commit_sha":null,"homepage":"","language":"TypeScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/abhinav2712.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-06-07T08:35:07.000Z","updated_at":"2023-06-07T08:56:58.000Z","dependencies_parsed_at":"2024-04-28T05:58:31.696Z","dependency_job_id":"536e26ca-d135-4ce5-af16-83b149b8c2d4","html_url":"https://github.com/abhinav2712/TimeComplexityCalculator","commit_stats":null,"previous_names":["abhinav2712/timecomplexitycalculator"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/abhinav2712%2FTimeComplexityCalculator","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/abhinav2712%2FTimeComplexityCalculator/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/abhinav2712%2FTimeComplexityCalculator/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/abhinav2712%2FTimeComplexityCalculator/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/abhinav2712","download_url":"https://codeload.github.com/abhinav2712/TimeComplexityCalculator/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/abhinav2712%2FTimeComplexityCalculator/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":259244394,"owners_count":22827717,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["app","big-o-notation","performance","react","react-app","time","time-complexity-analysis","typescript","web"],"created_at":"2024-12-24T09:16:05.967Z","updated_at":"2026-05-09T19:34:19.134Z","avatar_url":"https://github.com/abhinav2712.png","language":"TypeScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Time Complexity Calculator\n\nThe Time Complexity Calculator is a web application built with React that estimates the time complexity of a program in Big O notation.\n\n## Description\n\nThe Time Complexity Calculator allows you to input a program and analyzes its structure to estimate its time complexity. By counting the number of loop keywords (`for`, `while`, `do`), the app determines the maximum loop depth and provides an estimate of the time complexity as `O(n^maxLoopDepth)`.\n\n## Features\n\n- Input a program and calculate its time complexity\n- Estimate time complexity based on loop depth\n- Display time complexity in Big O notation\n\n## Installation\n\n1. Clone the repository:\n\n```shell\ngit clone \u003crepository_url\u003e\n```\n\n2. Navigate to the project directory:\n ```shell\ncd time-complexity-app\n```\n3. Install the dependencies:\n ```shell\nnpm install\n```\n## Usage\n1) Start the development server:\n```shell\nnpm start\n```\n2 )Open your browser and visit http://localhost:3000 to access the Time Complexity Calculator.\n\n3) Enter your program in the provided textarea.\n\n4) Click the \"Calculate Time Complexity\" button to estimate the time complexity.\n\n## Example\nHere's an example program to calculate the factorial of a number:\n![image](https://github.com/abhinav2712/TimeComplexityCalculator/assets/68495520/7be84fa7-f534-414b-9b2e-4c63b6d9b273)\n\n\nEntering this program in the app will estimate the time complexity as O(n).\n\n## Contributing\n\nContributions are welcome! If you find any issues or have suggestions for improvements, please feel free to submit a pull request.\n\n\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fabhinav2712%2Ftimecomplexitycalculator","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fabhinav2712%2Ftimecomplexitycalculator","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fabhinav2712%2Ftimecomplexitycalculator/lists"}