{"id":22000951,"url":"https://github.com/extwiii/algorithms-stanford.university","last_synced_at":"2026-03-19T21:30:19.485Z","repository":{"id":75415200,"uuid":"77797081","full_name":"extwiii/Algorithms-Stanford.University","owner":"extwiii","description":"Algorithms - Learn To Think Like A Computer Scientist - Coursera","archived":false,"fork":false,"pushed_at":"2017-02-02T18:11:39.000Z","size":81907,"stargazers_count":2,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-10-25T06:44:03.307Z","etag":null,"topics":["algorithm","analysis","computer-scientists","graph-search","greedy-algorithms","minimum-spanning-trees","quicksort","shortest-paths","stanford-university"],"latest_commit_sha":null,"homepage":null,"language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/extwiii.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":"2017-01-01T21:22:10.000Z","updated_at":"2021-11-10T11:31:37.000Z","dependencies_parsed_at":"2023-06-06T10:45:39.566Z","dependency_job_id":null,"html_url":"https://github.com/extwiii/Algorithms-Stanford.University","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/extwiii/Algorithms-Stanford.University","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/extwiii%2FAlgorithms-Stanford.University","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/extwiii%2FAlgorithms-Stanford.University/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/extwiii%2FAlgorithms-Stanford.University/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/extwiii%2FAlgorithms-Stanford.University/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/extwiii","download_url":"https://codeload.github.com/extwiii/Algorithms-Stanford.University/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/extwiii%2FAlgorithms-Stanford.University/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29585547,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-18T13:56:48.962Z","status":"ssl_error","status_checked_at":"2026-02-18T13:54:34.145Z","response_time":162,"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":["algorithm","analysis","computer-scientists","graph-search","greedy-algorithms","minimum-spanning-trees","quicksort","shortest-paths","stanford-university"],"created_at":"2024-11-29T23:11:45.538Z","updated_at":"2026-02-18T16:31:21.945Z","avatar_url":"https://github.com/extwiii.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# Algorithms-Stanford.University\n* Learn To Think Like A Computer Scientist, Algorithms - Stanford University - Coursera\n\n This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists.\n\n## Course 1 - Divide and Conquer, Sorting and Searching, and Randomized Algorithms\n* INTRODUCTION\n* ASYMPTOTIC ANALYSIS\n* DIVIDE \u0026 CONQUER ALGORITHMS\n* THE MASTER METHOD\n* QUICKSORT - ALGORITHM\n* QUICKSORT - ANALYSIS\n* PROBABILITY REVIEW\n* LINEAR-TIME SELECTION\n* GRAPHS AND THE CONTRACTION ALGORITHM\n\n## Course 2 - Graph Search, Shortest Paths, and Data Structures\n* GRAPH SEARCH AND CONNECTIVITY \n* DIJKSTRA'S SHORTEST-PATH ALGORITHM\n* HEAPS\n* BALANCED BINARY SEARCH TREES\n* HASHING: THE BASICS\n* UNIVERSAL HASHING\n* BLOOM FILTERS\n\n## Course 3 - Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming\n* TWO MOTIVATING APPLICATIONS\n* INTRODUCTION TO GREEDY ALGORITHMS\n* A SCHEDULING APPLICATION\n* PRIM'S MINIMUM SPANNING TREE ALGORITHM\n* KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM\n* CLUSTERING\n* ADVANCED UNION-FIND\n* HUFFMAN CODES\n* INTRODUCTION TO DYNAMIC PROGRAMMING\n* THE KNAPSACK PROBLEM\n* SEQUENCE ALIGNMENT \n* OPTIMAL BINARY SEARCH TREES\n\n## Course 4 - Shortest Paths Revisited, NP-Complete Problems and What To Do About Them\n* THE BELLMAN-FORD ALGORITHM\n* ALL-PAIRS SHORTEST PATHS\n* NP-COMPLETE PROBLEMS\n* FASTER EXACT ALGORITHMS FOR NP-COMPLETE PROBLEMS\n* APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS\n* LOCAL SEARCH ALGORITHMS\n* THE WIDER WORLD OF ALGORITHMS\n\n\n#### Taught by: \n*  Tim Roughgarden - Associate Professor, Computer Science\n\n### Rating     :full_moon::full_moon::full_moon::full_moon::full_moon::full_moon::new_moon::new_moon::new_moon::new_moon:\n### Difficulty :full_moon::full_moon::full_moon::full_moon::full_moon::full_moon::full_moon::full_moon::new_moon::new_moon:\n\n### Created By Bilal Cagiran | [E-Mail](mailto:bcagiran@hotmail.com) | [Github](https://github.com/extwiii/) | [LinkedIn](https://linkedin.com/in/bilalcagiran) | [CodePen](http://codepen.io/extwiii/) | [Blog/Site](http://bilalcagiran.com) | [FreeCodeCamp](https://www.freecodecamp.com/extwiii) \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fextwiii%2Falgorithms-stanford.university","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fextwiii%2Falgorithms-stanford.university","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fextwiii%2Falgorithms-stanford.university/lists"}