{"id":20966874,"url":"https://github.com/morintd/algorithms-go","last_synced_at":"2026-04-16T15:03:00.324Z","repository":{"id":244597399,"uuid":"815707988","full_name":"morintd/algorithms-go","owner":"morintd","description":"Implementation of multiple algorithms in Go.","archived":false,"fork":false,"pushed_at":"2024-07-06T12:05:48.000Z","size":15,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-20T02:39:36.368Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Go","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/morintd.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,"publiccode":null,"codemeta":null}},"created_at":"2024-06-15T22:47:28.000Z","updated_at":"2024-11-01T21:02:54.000Z","dependencies_parsed_at":"2024-06-16T14:45:04.861Z","dependency_job_id":"5f502b13-e6ed-4a7e-980d-d88cfb1f8cd9","html_url":"https://github.com/morintd/algorithms-go","commit_stats":null,"previous_names":["morintd/binary-search-tree-go","morintd/algorithms-go"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/morintd%2Falgorithms-go","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/morintd%2Falgorithms-go/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/morintd%2Falgorithms-go/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/morintd%2Falgorithms-go/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/morintd","download_url":"https://codeload.github.com/morintd/algorithms-go/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243364955,"owners_count":20279211,"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-19T03:01:23.828Z","updated_at":"2025-12-27T20:01:42.674Z","avatar_url":"https://github.com/morintd.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# algorithms-go\n\nImplementation of multiple algorithms in Go. Partially based on [The Last Algorithms Course You'll Ever Need](https://frontendmasters.com/courses/algorithms/) (originally in TypeScript).\n\n## Includes\n\n- Base Case Pathfinding\n- Binary Search List\n- Binary Search Tree (BST)\n- Bubble Sort\n- Double Linked List\n- Graph (Breadth First Search on Weighted Adjacency Matrix, Depth First Search on Weighted Adjacency List)\n- Heap (MinHeap)\n- Merge Sort\n- Queue\n- Quicksort\n- Stack\n- Tree (Breadth First Search, Traversal PreOrder/InOrder/PostOrder)\n- Two Crystall Balls problem\n\n## Commands\n\n```sh\n$ make test\n```","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmorintd%2Falgorithms-go","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmorintd%2Falgorithms-go","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmorintd%2Falgorithms-go/lists"}