{"id":20882454,"url":"https://github.com/1ambda/algorithm","last_synced_at":"2025-07-11T14:35:59.787Z","repository":{"id":15503003,"uuid":"18237002","full_name":"1ambda/algorithm","owner":"1ambda","description":null,"archived":false,"fork":false,"pushed_at":"2014-12-30T08:59:06.000Z","size":12472,"stargazers_count":4,"open_issues_count":0,"forks_count":3,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-06-29T09:04:40.859Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Java","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/1ambda.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":"2014-03-29T07:55:10.000Z","updated_at":"2021-09-13T14:33:19.000Z","dependencies_parsed_at":"2022-09-14T08:02:38.592Z","dependency_job_id":null,"html_url":"https://github.com/1ambda/algorithm","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/1ambda/algorithm","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/1ambda%2Falgorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/1ambda%2Falgorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/1ambda%2Falgorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/1ambda%2Falgorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/1ambda","download_url":"https://codeload.github.com/1ambda/algorithm/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/1ambda%2Falgorithm/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":264833288,"owners_count":23670617,"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":[],"created_at":"2024-11-18T07:31:47.712Z","updated_at":"2025-07-11T14:35:59.758Z","avatar_url":"https://github.com/1ambda.png","language":"Java","readme":"# algorithm note\r\n\r\n### **Algorithm: Design and Analysis Part 1** \r\n\r\nby *Tim Roughgarden*\r\n\r\n(1) [Divide and Conquer](http://1ambda.github.io/divide-and-conquer/)  \r\n(2) [Randomized Selection](http://1ambda.github.io/randomized-selection/)  \r\n(3) [Graphs, The Contraction Algorithm](http://1ambda.github.io/graphs-the-contraction-algorithm/)  \r\n(4) [Graph Search and Connectivity](http://1ambda.github.io/graph-search-and-connectivity/)  \r\n(5) [Dijkstra, Heap, Red-Black Tree](http://1ambda.github.io/dijkstra-heap-balanced-tree/)  \r\n(6) [Hash Table, Universal Hashing, Bloom filters](http://1ambda.github.io/hash-table-universal-hashing-bloom-filters/)  \r\n\r\n### **Algorithms, Part 1** \r\n\r\nby *Robert Sedgewick*\r\n\r\n(1) [Union Find](http://1ambda.github.io/union-find-algorithms-week-1/)  \r\n(2) [Analysis of Algorithms](http://1ambda.github.io/analysis-of-algorithms/) \r\n\r\n### **Algorithms, Part 2**\r\nby *Robert Sedgewick*\r\n\r\n(1) [Spanning Tree, Shortest Paths](http://1ambda.github.io/graph-challenges-minimum-spanning-trees)  \r\n(2) [Radix Sort, Suffix Sort](http://1ambda.github.io/radix-sort-suffix-sort)  \r\n(3) [R-way, Ternary Tries](http://1ambda.github.io/r-way-ternary-search-tries/)   \r\n(4) [KMP, Boyer-Moore, Rabin-Karp](http://1ambda.github.io/substring-search/)   \r\n(5) [Maximum Flow (Ford-Fulkerson)](http://1ambda.github.io/maximum-flow/)   \r\n(6) [Data Compression, Huffman, LZW](http://1ambda.github.io/algorithm-data-compression/)   \r\n\r\n### Scala\r\n\r\n- Project Euler (26 / 450)\r\n- quick sort\r\n- random contraction\r\n- strongly connected components\r\n- dijkstra shortest path\r\n- 2-sum, median maintenance\r\n\r\n\r\n### Java\r\n\r\n - Union Find\r\n - LSD, MSD, Longest Repeated Substrings\r\n - R-way, Ternary Tries\r\n\r\n### C++\r\n\r\ndata structure\r\n\r\n- Linked list\r\n- Double linked list\r\n- Stack\r\n- Heap\r\n- Binary search tree\r\n\r\nsorting\r\n\r\n- Merge sort\r\n- Quick sort\r\n- Selection sort\r\n- Bubble sort\r\n- Insertion sort\r\n\r\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2F1ambda%2Falgorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2F1ambda%2Falgorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2F1ambda%2Falgorithm/lists"}