{"id":16937009,"url":"https://github.com/markus28/algorithms-design-and-analysis","last_synced_at":"2026-04-20T09:05:20.262Z","repository":{"id":129120705,"uuid":"115437763","full_name":"Markus28/Algorithms-Design-and-Analysis","owner":"Markus28","description":"C++, Python and Java Implementation of Algorithms presented in Stanford's \"Algorithms: Design and Analysis\" course","archived":false,"fork":false,"pushed_at":"2021-10-08T14:41:33.000Z","size":2671,"stargazers_count":0,"open_issues_count":2,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-06-05T04:44:37.413Z","etag":null,"topics":["algorithms","algorithms-python","algorithms-stanford","graphs"],"latest_commit_sha":null,"homepage":"","language":"C++","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/Markus28.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,"zenodo":null}},"created_at":"2017-12-26T16:26:22.000Z","updated_at":"2021-10-08T14:41:36.000Z","dependencies_parsed_at":"2023-04-04T01:33:16.198Z","dependency_job_id":null,"html_url":"https://github.com/Markus28/Algorithms-Design-and-Analysis","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Markus28/Algorithms-Design-and-Analysis","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Markus28%2FAlgorithms-Design-and-Analysis","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Markus28%2FAlgorithms-Design-and-Analysis/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Markus28%2FAlgorithms-Design-and-Analysis/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Markus28%2FAlgorithms-Design-and-Analysis/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Markus28","download_url":"https://codeload.github.com/Markus28/Algorithms-Design-and-Analysis/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Markus28%2FAlgorithms-Design-and-Analysis/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32040364,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-20T00:18:06.643Z","status":"online","status_checked_at":"2026-04-20T02:00:06.527Z","response_time":94,"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":["algorithms","algorithms-python","algorithms-stanford","graphs"],"created_at":"2024-10-13T20:58:27.250Z","updated_at":"2026-04-20T09:05:20.256Z","avatar_url":"https://github.com/Markus28.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Algorithms-Design-and-Analaysis\nPython and Java Implementation of Algorithms presented in Stanford's \"Algorithms: Design and Analysis\" course.\nThe following Algorithms and Datastructures have been implemented:\n### Python and Cython\n- Merge Sort and related algorithms\n- Quicksort and related algorithms\n- Contraction algorithm for minimum cut problem (Graphs)\n- Dijkstra's algorithm (heap based)\n- Breadth-first search\n- Depth-first search\n- Computation of strongly connected components in directed Graphs\n- Las Vegas median finding\n### C++\n- Fibonacci Heap\n- Kruskal using Union-Find forest\n- Kruskal using Fibonacci Heap\n### Java\n- Hash Table\n- Bloom Filter\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmarkus28%2Falgorithms-design-and-analysis","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmarkus28%2Falgorithms-design-and-analysis","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmarkus28%2Falgorithms-design-and-analysis/lists"}