{"id":27441300,"url":"https://github.com/leoborai/grokking-algorithms-rust","last_synced_at":"2025-07-08T12:35:05.796Z","repository":{"id":104133198,"uuid":"342081384","full_name":"LeoBorai/grokking-algorithms-rust","owner":"LeoBorai","description":"Grokking Algorithms implementations in Rust","archived":false,"fork":false,"pushed_at":"2023-11-12T22:24:03.000Z","size":46,"stargazers_count":9,"open_issues_count":0,"forks_count":5,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-14T07:09:10.127Z","etag":null,"topics":["algorithms","grokking","implementations","learning","rust"],"latest_commit_sha":null,"homepage":"","language":"Rust","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/LeoBorai.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":"2021-02-25T01:03:55.000Z","updated_at":"2025-01-27T19:07:52.000Z","dependencies_parsed_at":null,"dependency_job_id":"bf7ee643-0dc2-47b5-b13e-1cbc2fbeeb8e","html_url":"https://github.com/LeoBorai/grokking-algorithms-rust","commit_stats":null,"previous_names":["leoborai/grokking-algorithms-rust"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LeoBorai%2Fgrokking-algorithms-rust","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LeoBorai%2Fgrokking-algorithms-rust/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LeoBorai%2Fgrokking-algorithms-rust/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LeoBorai%2Fgrokking-algorithms-rust/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/LeoBorai","download_url":"https://codeload.github.com/LeoBorai/grokking-algorithms-rust/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248980556,"owners_count":21193134,"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":["algorithms","grokking","implementations","learning","rust"],"created_at":"2025-04-14T23:34:44.122Z","updated_at":"2025-04-14T23:34:44.745Z","avatar_url":"https://github.com/LeoBorai.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003cdiv\u003e\n  \u003cdiv align=\"center\" style=\"display: block; text-align: center;\"\u003e\n    \u003cimg src=\"./assets/artwork.png\" height=\"120\" /\u003e\n  \u003c/div\u003e\n  \u003ch1 align=\"center\"\u003egrokking-algorithms-rust\u003c/h1\u003e\n  \u003ch4 align=\"center\"\u003e\n    Grokking Algorithms implementations in Rust\n  \u003c/h4\u003e\n\u003c/div\u003e\n\n\u003cdiv align=\"center\"\u003e\n\n  ![Build](https://github.com/EstebanBorai/grokking-algorithms-rust/workflows/build/badge.svg)\n  ![Formatting](https://github.com/EstebanBorai/grokking-algorithms-rust/workflows/fmt/badge.svg)\n  ![Tests](https://github.com/EstebanBorai/grokking-algorithms-rust/workflows/tests/badge.svg)\n\n\u003c/div\u003e\n\n# Contents\n\nName | Description\n--- | ---\n[Binary Search](./src/binary_search.rs) | Search algorithm used to find elements in sorted lists\n[Selection Sort](./src/selection_sort.rs) | Search algorithms used to find element in unsorted lists\n[Quick Sort](./src/quicksort.rs) | Sorting algorithm that uses the divide and conquer approach\n[Find Max (Recursive)](./src/find_max_recursive.rs) | Finds the maximum value on a collection using a recursive approach\n[Sum (Recursive)](./src/sum_recursive.rs) | Sums elements in a collection using a recursive approach\n[Queue](./src/queue.rs) | A FIFO data structure\n[Stack](./src/stack.rs) | A LIFO data structure\n[Breadth First Search](./src/breadth_first_search.rs) | An algorithm to find the shortest paths on a Graph\n[Dijkstra's Algorithm](./src/dijkstras.rs) | An algorithm to find th cheapest path on weighted graphs\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fleoborai%2Fgrokking-algorithms-rust","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fleoborai%2Fgrokking-algorithms-rust","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fleoborai%2Fgrokking-algorithms-rust/lists"}