{"id":26025361,"url":"https://github.com/codewithdark-git/aoa---analysis-of-algorithms","last_synced_at":"2025-10-04T09:00:25.811Z","repository":{"id":279761183,"uuid":"939538437","full_name":"codewithdark-git/AOA---Analysis-of-Algorithms","owner":"codewithdark-git","description":"AOA - Analysis of Algorithms","archived":false,"fork":false,"pushed_at":"2025-03-05T14:39:18.000Z","size":5,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-06T13:41:44.004Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/codewithdark-git.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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":"2025-02-26T17:45:32.000Z","updated_at":"2025-03-05T14:39:22.000Z","dependencies_parsed_at":"2025-03-06T13:38:42.593Z","dependency_job_id":null,"html_url":"https://github.com/codewithdark-git/AOA---Analysis-of-Algorithms","commit_stats":null,"previous_names":["codewithdark-git/aoa---analysis-of-algorithms"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/codewithdark-git/AOA---Analysis-of-Algorithms","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codewithdark-git%2FAOA---Analysis-of-Algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codewithdark-git%2FAOA---Analysis-of-Algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codewithdark-git%2FAOA---Analysis-of-Algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codewithdark-git%2FAOA---Analysis-of-Algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/codewithdark-git","download_url":"https://codeload.github.com/codewithdark-git/AOA---Analysis-of-Algorithms/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codewithdark-git%2FAOA---Analysis-of-Algorithms/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":278289500,"owners_count":25962355,"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","status":"online","status_checked_at":"2025-10-04T02:00:05.491Z","response_time":63,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":[],"created_at":"2025-03-06T13:35:57.336Z","updated_at":"2025-10-04T09:00:25.799Z","avatar_url":"https://github.com/codewithdark-git.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Algorithm Analysis Tool\n\nThis tool analyzes and visualizes the time and space complexity of different sorting algorithms.\n\n## Features\n\n- Implementation of Bubble Sort and Selection Sort algorithms\n- Time complexity analysis\n- Space complexity analysis\n- Visualization using matplotlib\n\n## Requirements\n\n- Python 3.x\n- matplotlib\n- numpy\n\n## Usage\n\nRun the script using:\n\n```bash\npython algorithm_analysis.py\n```\n\nThis will generate two plots:\n1. Time Complexity Analysis - showing how execution time grows with input size\n2. Space Complexity Analysis - showing how memory usage grows with input size\n\n## Understanding the Graphs\n\n- The x-axis represents the input size (n)\n- For time complexity: y-axis shows execution time in seconds\n- For space complexity: y-axis shows memory usage in KB\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcodewithdark-git%2Faoa---analysis-of-algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcodewithdark-git%2Faoa---analysis-of-algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcodewithdark-git%2Faoa---analysis-of-algorithms/lists"}