{"id":19820387,"url":"https://github.com/drcbeatz/master-theorem","last_synced_at":"2026-04-07T18:31:52.509Z","repository":{"id":221779224,"uuid":"754911843","full_name":"DrCBeatz/master-theorem","owner":"DrCBeatz","description":"Web app to evaluate the time complexity of divide and conquer algorithms using the Master Theorem and visualize the results. (Python/FastAPI/Typescript/React/Docker/AWS-Lambda/DynamoDB/Github Actions CI)","archived":false,"fork":false,"pushed_at":"2025-04-27T20:55:18.000Z","size":4027,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2026-01-03T14:28:19.344Z","etag":null,"topics":["aws","cd-ci","chartjs","docker","dynamodb","fastapi","github-actions","lambda","master-theorem","pytest","python","react","severless","typescript","vite","vitest"],"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/DrCBeatz.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,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2024-02-09T02:10:45.000Z","updated_at":"2025-04-27T20:55:21.000Z","dependencies_parsed_at":"2024-04-14T22:44:30.464Z","dependency_job_id":null,"html_url":"https://github.com/DrCBeatz/master-theorem","commit_stats":null,"previous_names":["drcbeatz/master-theorem"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/DrCBeatz/master-theorem","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DrCBeatz%2Fmaster-theorem","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DrCBeatz%2Fmaster-theorem/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DrCBeatz%2Fmaster-theorem/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DrCBeatz%2Fmaster-theorem/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/DrCBeatz","download_url":"https://codeload.github.com/DrCBeatz/master-theorem/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DrCBeatz%2Fmaster-theorem/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31524524,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-07T16:28:08.000Z","status":"ssl_error","status_checked_at":"2026-04-07T16:28:06.951Z","response_time":105,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["aws","cd-ci","chartjs","docker","dynamodb","fastapi","github-actions","lambda","master-theorem","pytest","python","react","severless","typescript","vite","vitest"],"created_at":"2024-11-12T10:23:07.291Z","updated_at":"2026-04-07T18:31:52.473Z","avatar_url":"https://github.com/DrCBeatz.png","language":"TypeScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Master Theorem Evaluation Web App\n\nThis web application allows users to evaluate recursive divide-and-conquer algorithms using the Master Theorem to determine their time complexity, providing valuable insights into algorithm performance.\n\nAlgorithms with the following recurrence relation (Master Recurrence) can be evaluated:\n\n```\nT(n) = aT(n/b) + f(n)\n```\n\nwhere:\n\n- **a** = number of recursive subproblems (a \u003e 0)\n- **b** = factor by which the problem size is reduced (b \u003e 1)\n- **k** = exponent of the work outside the recursion\n\n## Features\n\n- Evaluate the time complexity of divide-and-conquer algorithms.\n- Visualize algorithm performance.\n- Compare preset algorithms (e.g., binary search, merge sort).\n- View Python code and descriptions for preset algorithms.\n\n## How to Use the App\n\n1. Enter your values for **a**, **b**, and **k** in the input fields.\n2. Select 'User Input' under 'Enter Values or Choose Algorithm'.\n3. Click **Evaluate** to see results.\n\n### Example Inputs:\n\n- a = 4, b = 2, k = 1\n- a = 4, b = 2, k = 2\n- a = 4, b = 2, k = 3\n\nOr choose preset algorithms from the dropdown, then click **Evaluate** to see algorithm details.\n\n## Local Installation\n\n### Prerequisites:\n\n- Docker CLI\n- Node Package Manager (NPM)\n- Material Design for Bootstrap Pro for React (MDB Pro)\n\n### MDB Pro Setup\n\nThis project requires Material Design for Bootstrap Pro for React to run locally. You must include your MDB Pro key using the `MDB_PRO_KEY` environment variable.\n\nBefore starting the Docker container, run:\n\n```bash\ncd frontend\nnpm run add-mdb-key\ncd ..\n```\n\nBefore committing changes to GitHub, ensure your MDB key is not included by running:\n\n```bash\ncd frontend\nnpm run remove-mdb-key\ncd ..\n```\n\n### Clone and Setup\n\nClone and navigate to the project:\n\n```bash\ngit clone https://github.com/drcbeatz/master-theorem.git\ncd master-theorem\n```\n\nBuild and run Docker containers:\n\n```bash\ndocker compose up -d --build\n```\n\nContainers launched:\n\n- Backend service at **port 8000**\n- Frontend service at **port 5173**\n- Local DynamoDB at **port 8001**\n\n## Running Tests\n\n### Backend Tests\n\nFrom the project's root directory:\n\n**Run tests with coverage (recommended)**:\n\n```bash\ndocker compose run --rm test /bin/bash -c \"\n  python backend/scripts/init_db.py || true\n  pytest --cov=backend --cov-report=term-missing --cov-report=html:coverage/html backend/tests\n\"\n```\n\nThis will:\n\n- Initialize DynamoDB if required.\n- Run `pytest` with coverage reports.\n\n### Frontend Tests\n\nRun React/Vitest tests from the `frontend` directory:\n\n```bash\nnpm test\n```\n\nTo view test coverage:\n\n```bash\nnpm run test:coverage\n```\n\n## References\n\n- Cormen, T. H., Leiserson, C. E., Rivest, R. L., \u0026 Stein, C. (2022). _Introduction to Algorithms_ (4th ed.). MIT Press.\n\n---\n\nHappy Coding! If you encounter issues, please open an issue or submit a pull request.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdrcbeatz%2Fmaster-theorem","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdrcbeatz%2Fmaster-theorem","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdrcbeatz%2Fmaster-theorem/lists"}