{"id":16801120,"url":"https://github.com/connor-mccarthy/algorithms-specialization-stanford","last_synced_at":"2025-07-26T04:02:49.884Z","repository":{"id":53942796,"uuid":"333637770","full_name":"connor-mccarthy/algorithms-specialization-stanford","owner":"connor-mccarthy","description":"Code and notes for the Stanford Algorithms Specialization course.","archived":false,"fork":false,"pushed_at":"2022-01-31T21:29:25.000Z","size":27114,"stargazers_count":3,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-06-30T02:04:15.669Z","etag":null,"topics":["algorithms","divide-and-conquer","graph-search","graphs","python","search-algorithm","sort-algorithm","stanford-algorithms-specialization"],"latest_commit_sha":null,"homepage":"","language":"Python","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/connor-mccarthy.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}},"created_at":"2021-01-28T03:46:33.000Z","updated_at":"2023-11-15T17:13:23.000Z","dependencies_parsed_at":"2022-08-13T05:10:46.675Z","dependency_job_id":null,"html_url":"https://github.com/connor-mccarthy/algorithms-specialization-stanford","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/connor-mccarthy/algorithms-specialization-stanford","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/connor-mccarthy%2Falgorithms-specialization-stanford","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/connor-mccarthy%2Falgorithms-specialization-stanford/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/connor-mccarthy%2Falgorithms-specialization-stanford/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/connor-mccarthy%2Falgorithms-specialization-stanford/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/connor-mccarthy","download_url":"https://codeload.github.com/connor-mccarthy/algorithms-specialization-stanford/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/connor-mccarthy%2Falgorithms-specialization-stanford/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":267116108,"owners_count":24038623,"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-07-26T02:00:08.937Z","response_time":62,"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","divide-and-conquer","graph-search","graphs","python","search-algorithm","sort-algorithm","stanford-algorithms-specialization"],"created_at":"2024-10-13T09:35:56.902Z","updated_at":"2025-07-26T04:02:49.834Z","avatar_url":"https://github.com/connor-mccarthy.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003cdiv align=\"center\"\u003e\n  \u003ch1\u003eStanford Algorithms Specialization\u003c/h1\u003e\n\n\u003cp align=\"center\"\u003e\n\n\u003ca href=\"https://github.com/connor-mccarthy/algorithms-specialization-stanford/workflows/build/badge.svg\"\u003e\n    \u003cimg src=\"https://github.com/connor-mccarthy/algorithms-specialization-stanford/workflows/build/badge.svg\" alt=\"Build\" /\u003e\n\u003c/a\u003e\n\u003ca href=\"https://img.shields.io/badge/python-3.7.10-blue.svg\"\u003e\n    \u003cimg src=\"https://img.shields.io/badge/python-3.7.10-blue.svg\" alt=\"Python 3.7.10\" /\u003e\n\u003c/a\u003e\n\u003ca href=\"https://img.shields.io/badge/code%20style-black-000000.svg\"\u003e\n    \u003cimg src=\"https://img.shields.io/badge/code%20style-black-000000.svg\" alt=\"Code style: black\" \u003e\n\u003c/a\u003e\n\u003ca href=\"https://codecov.io/gh/connor-mccarthy/algorithms-specialization-stanford/branch/master/graph/badge.svg?token=4AHCWFKISX\"\u003e\n    \u003cimg src=\"https://codecov.io/gh/connor-mccarthy/algorithms-specialization-stanford/branch/master/graph/badge.svg?token=4AHCWFKISX\" alt=\"codecov\" \u003e\n\u003c/a\u003e\n\n\u003cp\u003eCode and notes for the \u003ca href=https://www.coursera.org/specializations/algorithms\u003eAlgorithms Specialization\u003c/a\u003e course offered by Stanford University.\u003c/p\u003e\n\u003c/div\u003e\n\n\u003cdiv align=\"center\"\u003e\n\u003ch2\u003eAlgorithms\u003c/h2\u003e\n\u003c/div\u003e\n\n### Course 1\n\n- [Karatsuba multiplication](./src/course1/week1/karatsuba/karatsuba.py)\n- [Merge sort](./src/course1/week1/merge_sort/merge_sort.py)\n- [Inversion counter](./src/course1/week2/inversion_counter/inversion_counter.py)\n- [Strassens matrix multiplication](./src/course1/week2/strassens_matrix_multiplication/strassens.py)\n- [Quicksort](./src/course1/week3/quicksort/quicksort.py)\n- [Randomized selection](./src/course1/week4/randomized_selection/randomized_selection.py)\n- [Random contraction](./src/course1/week4/graphs/random_contraction/random_contraction.py)\n\n### Course 2\n\n- [Breadth first graph search (BFS)](./src/course2/week1/breadth_first_search/basic/bfs.py)\n- [BFS for computing shortest path](./src/course2/week1/breadth_first_search/shortest_path/shortest_path.py)\n- [Depth first graph search (DFS)](./src/course2/week1/depth_first_search/basic/dfs.py)\n- [DFS for computing topological ordering of DAG](./src/course2/week1/depth_first_search/topological_ordering/topological_ordering.py)\n- [Kosaraju's two-pass for computing strongly connected graph components](./src/course2/week1/strongly_connected_components/kosaraju.py)\n- [Dijkstra's shortest path](./src/course2/week2/dijkstra.py)\n- [Median maintenance via heaps](./src/course2/week3/median_maintenance_assignment/median_maintenance_assignment.py)\n- [TwoSum via hash table](./src/course2/week4/two_sum.py)\n\n### Course 3\n\n- [Greedy scheduling algorithm](./src/course3/week1/scheduling/scheduler.py)\n- [Prim's minimum spanning tree algorithm](./src/course3/week1/prims_mst/prims.py)\n- [Kruskal's minimum spanning tree algorithm](./src/course3/week2/kruskal/kruskal.py)\n- [Maximally spaced k-clustering](./src/course3/week2/clustering/clustering.py)\n- [Huffman optimal binary prefix-free encoding](./src/course3/week3/huffman_codes/huffman.py)\n- [Max weight independent set in path graph](./src/course3/week3/dynamic_programming/wis.py)\n- [The knapsack problem](./src/course3/week4/knapsack_problem/knapsack.py)\n\n\u003cdiv align=\"center\"\u003e\n\u003ch2\u003eCertificates\u003c/h2\u003e\n\u003c/div\u003e\n\n[Course 1](./src/course1/course1_certificate.pdf)\n\n[Course 2](./src/course2/course2_certificate.pdf)\n\n[Course 3](./src/course3/course3_certificate.pdf)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fconnor-mccarthy%2Falgorithms-specialization-stanford","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fconnor-mccarthy%2Falgorithms-specialization-stanford","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fconnor-mccarthy%2Falgorithms-specialization-stanford/lists"}