{"id":20122238,"url":"https://github.com/ankit-ap-paul/algorithms-4th-sem","last_synced_at":"2026-06-08T12:04:20.381Z","repository":{"id":165377928,"uuid":"637634039","full_name":"Ankit-AP-Paul/Algorithms-4th-Sem","owner":"Ankit-AP-Paul","description":"Design of Algorithms using C++","archived":false,"fork":false,"pushed_at":"2023-05-19T02:10:14.000Z","size":276,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-02T20:28:12.276Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"C++","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/Ankit-AP-Paul.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-05-08T04:54:26.000Z","updated_at":"2023-05-15T06:46:59.000Z","dependencies_parsed_at":null,"dependency_job_id":"6b069227-3505-44d2-a443-4de3fa4d82f0","html_url":"https://github.com/Ankit-AP-Paul/Algorithms-4th-Sem","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Ankit-AP-Paul/Algorithms-4th-Sem","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ankit-AP-Paul%2FAlgorithms-4th-Sem","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ankit-AP-Paul%2FAlgorithms-4th-Sem/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ankit-AP-Paul%2FAlgorithms-4th-Sem/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ankit-AP-Paul%2FAlgorithms-4th-Sem/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Ankit-AP-Paul","download_url":"https://codeload.github.com/Ankit-AP-Paul/Algorithms-4th-Sem/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ankit-AP-Paul%2FAlgorithms-4th-Sem/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34061126,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-08T02:00:07.615Z","response_time":111,"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":"2024-11-13T19:35:50.799Z","updated_at":"2026-06-08T12:04:20.365Z","avatar_url":"https://github.com/Ankit-AP-Paul.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Design \u0026 Analysis of Algorithms using C++\n\nThis repository focuses on designing an algorithm, its implementation, and analysis using the C++ programming language.\n\n## Contains\n\n- Graph Algorithms\n  - Adjacency Matrix\n  - Adjacency List\n  - BFS\n  - DFS\n  - Topological Sort\n- Greedy Algorithms\n  - Prim's Algorithm\n  - Kruskal's Algorithm\n  - Dijkstra's Algorithm\n  - Fractional Knapsack\n  - Job Sequencing with deadline\n- Divide and Conquer Algorithms\n  - Binary Search\n  - Ternary Search\n  - Maximum Minimum\n  - Merge Sort\n  - Quick Sort (Hoare \u0026 Lomuto's Algorithms)\n  - Randomized Quick Sort\n- Dynamic Programming Problems\n  - 0/1 Knapsack\n  - Bellman Ford's Single Source Shortest Path Algorithm\n  - Floyd Warshall's All Pair of Shortest Path Algorithm\n  - Maximum number of scalar multiplications for Matrix Chain Multiplication\n- Backtracking Problems\n  - n Queen Problem\n  - Graph Coloring Problem\n  - Hamiltonian Problem \n\n## Authors\n\n- [@Ankit Paul](https://github.com/Ankit-AP-Paul)\n\n## Feedback\n\nIf you have any feedback, please reach out to me at ankitpaul894@gmail.com\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fankit-ap-paul%2Falgorithms-4th-sem","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fankit-ap-paul%2Falgorithms-4th-sem","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fankit-ap-paul%2Falgorithms-4th-sem/lists"}