{"id":27865193,"url":"https://github.com/rajgoesout/algorithms","last_synced_at":"2025-05-04T21:19:42.550Z","repository":{"id":111617799,"uuid":"143727706","full_name":"rajgoesout/Algorithms","owner":"rajgoesout","description":"Implementation of basic data structures \u0026 algorithms.","archived":false,"fork":false,"pushed_at":"2019-04-24T05:50:50.000Z","size":181,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2024-03-02T14:17:30.105Z","etag":null,"topics":["algorithm","divide-and-conquer","python"],"latest_commit_sha":null,"homepage":null,"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/rajgoesout.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}},"created_at":"2018-08-06T12:48:09.000Z","updated_at":"2024-03-02T14:17:31.374Z","dependencies_parsed_at":"2023-05-03T15:01:44.868Z","dependency_job_id":null,"html_url":"https://github.com/rajgoesout/Algorithms","commit_stats":null,"previous_names":["rajgoesout/algorithms"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rajgoesout%2FAlgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rajgoesout%2FAlgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rajgoesout%2FAlgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rajgoesout%2FAlgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/rajgoesout","download_url":"https://codeload.github.com/rajgoesout/Algorithms/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":252399947,"owners_count":21741738,"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","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","divide-and-conquer","python"],"created_at":"2025-05-04T21:19:41.957Z","updated_at":"2025-05-04T21:19:42.544Z","avatar_url":"https://github.com/rajgoesout.png","language":"Python","readme":"# Algorithms\n\nPython implementation of algorithms from [CLRS](https://en.wikipedia.org/wiki/Introduction_to_Algorithms) book.\n\n### Part 1: Divide and Conquer, Sorting and Searching, and Randomized Algorithms\n\nPrimary topics: asymptotic (\"Big-oh\") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts).\n\n### Part 2: Graph Search, Shortest Paths, and Data Structures\n\nPrimary topics: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applications (ranging from deduplication to social network analysis).\n\n### Part 3: Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming\n\nPrimary topics: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).\n\n### Part 4: Shortest Paths Revisited, NP-Complete Problems and What To Do About Them\n\nPrimary topics: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis of heuristics, local search).\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frajgoesout%2Falgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frajgoesout%2Falgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frajgoesout%2Falgorithms/lists"}