{"id":13630688,"url":"https://github.com/arnauddri/algorithms","last_synced_at":"2025-09-14T08:29:25.759Z","repository":{"id":25913978,"uuid":"29354853","full_name":"arnauddri/algorithms","owner":"arnauddri","description":"Algorithms \u0026 Data Structures in Go","archived":false,"fork":false,"pushed_at":"2021-02-04T20:14:12.000Z","size":1806,"stargazers_count":1857,"open_issues_count":20,"forks_count":267,"subscribers_count":86,"default_branch":"master","last_synced_at":"2025-08-14T11:59:13.124Z","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":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/arnauddri.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}},"created_at":"2015-01-16T15:43:01.000Z","updated_at":"2025-08-05T18:17:53.000Z","dependencies_parsed_at":"2022-07-27T05:46:24.614Z","dependency_job_id":null,"html_url":"https://github.com/arnauddri/algorithms","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/arnauddri/algorithms","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/arnauddri%2Falgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/arnauddri%2Falgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/arnauddri%2Falgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/arnauddri%2Falgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/arnauddri","download_url":"https://codeload.github.com/arnauddri/algorithms/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/arnauddri%2Falgorithms/sbom","scorecard":{"id":207773,"data":{"date":"2025-08-11","repo":{"name":"github.com/arnauddri/algorithms","commit":"736f5ebe59cfd72b778704fe9ba5e0ba25c775fe"},"scorecard":{"version":"v5.2.1-40-gf6ed084d","commit":"f6ed084d17c9236477efd66e5b258b9d4cc7b389"},"score":3,"checks":[{"name":"Dangerous-Workflow","score":-1,"reason":"no workflows found","details":null,"documentation":{"short":"Determines if the project's GitHub Action workflows avoid dangerous patterns.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#dangerous-workflow"}},{"name":"Packaging","score":-1,"reason":"packaging workflow not detected","details":["Warn: no GitHub/GitLab publishing workflow detected."],"documentation":{"short":"Determines if the project is published as a package that others can easily download, install, easily update, and uninstall.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#packaging"}},{"name":"Code-Review","score":0,"reason":"Found 0/30 approved changesets -- score normalized to 0","details":null,"documentation":{"short":"Determines if the project requires human code review before pull requests (aka merge requests) are merged.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#code-review"}},{"name":"SAST","score":0,"reason":"no SAST tool detected","details":["Warn: no pull requests merged into dev branch"],"documentation":{"short":"Determines if the project uses static code analysis.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#sast"}},{"name":"Token-Permissions","score":-1,"reason":"No tokens found","details":null,"documentation":{"short":"Determines if the project's workflows follow the principle of least privilege.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#token-permissions"}},{"name":"Maintained","score":0,"reason":"0 commit(s) and 0 issue activity found in the last 90 days -- score normalized to 0","details":null,"documentation":{"short":"Determines if the project is \"actively maintained\".","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#maintained"}},{"name":"Binary-Artifacts","score":10,"reason":"no binaries found in the repo","details":null,"documentation":{"short":"Determines if the project has generated executable (binary) artifacts in the source repository.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#binary-artifacts"}},{"name":"Pinned-Dependencies","score":-1,"reason":"no dependencies found","details":null,"documentation":{"short":"Determines if the project has declared and pinned the dependencies of its build process.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#pinned-dependencies"}},{"name":"CII-Best-Practices","score":0,"reason":"no effort to earn an OpenSSF best practices badge detected","details":null,"documentation":{"short":"Determines if the project has an OpenSSF (formerly CII) Best Practices Badge.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#cii-best-practices"}},{"name":"Security-Policy","score":0,"reason":"security policy file not detected","details":["Warn: no security policy file detected","Warn: no security file to analyze","Warn: no security file to analyze","Warn: no security file to analyze"],"documentation":{"short":"Determines if the project has published a security policy.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#security-policy"}},{"name":"Vulnerabilities","score":10,"reason":"0 existing vulnerabilities detected","details":null,"documentation":{"short":"Determines if the project has open, known unfixed vulnerabilities.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#vulnerabilities"}},{"name":"License","score":9,"reason":"license file detected","details":["Info: project has a license file: LICENSE:0","Warn: project license file does not contain an FSF or OSI license."],"documentation":{"short":"Determines if the project has defined a license.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#license"}},{"name":"Fuzzing","score":0,"reason":"project is not fuzzed","details":["Warn: no fuzzer integrations found"],"documentation":{"short":"Determines if the project uses fuzzing.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#fuzzing"}},{"name":"Signed-Releases","score":-1,"reason":"no releases found","details":null,"documentation":{"short":"Determines if the project cryptographically signs release artifacts.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#signed-releases"}},{"name":"Branch-Protection","score":0,"reason":"branch protection not enabled on development/release branches","details":["Warn: branch protection not enabled for branch 'master'"],"documentation":{"short":"Determines if the default and release branches are protected with GitHub's branch protection settings.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#branch-protection"}}]},"last_synced_at":"2025-08-17T00:08:38.847Z","repository_id":25913978,"created_at":"2025-08-17T00:08:38.847Z","updated_at":"2025-08-17T00:08:38.847Z"},"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":275078682,"owners_count":25401773,"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","status":"online","status_checked_at":"2025-09-14T02:00:10.474Z","response_time":75,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":[],"created_at":"2024-08-01T22:01:54.975Z","updated_at":"2025-09-14T08:29:25.726Z","avatar_url":"https://github.com/arnauddri.png","language":"Go","funding_links":[],"categories":["Go","Github Libraries"],"sub_categories":[],"readme":"# Algorithms [![Build Status](https://travis-ci.org/arnauddri/algorithms.svg?branch=master)](https://travis-ci.org/arnauddri/algorithms)\n\nClassic algorithms and data structures implemented in Go. Not for production use, it is mostly an attempt to get comfortable both with Go and key CS concepts.\n\n### Contents\n\n#### Data Structures\n\n* [Binary Search Tree](https://github.com/arnauddri/algorithms/tree/master/data-structures/binary-tree) [(wiki)](http://en.wikipedia.org/wiki/Binary_tree)\n* [Graph](https://github.com/arnauddri/algorithms/tree/master/data-structures/graph) [(wiki)](http://en.wikipedia.org/wiki/Graph_%28abstract_data_type)\n* [Hash Tables](https://github.com/arnauddri/algorithms/tree/master/data-structures/hash-tables) [(wiki)](http://en.wikipedia.org/wiki/Hash_table)\n* [Linked List](https://github.com/arnauddri/algorithms/tree/master/data-structures/linked-list) [(wiki)](http://en.wikipedia.org/wiki/Linked_list)\n* [Matrix](https://github.com/arnauddri/algorithms/tree/master/data-structures/matrix) [(wiki)](http://en.wikipedia.org/wiki/Matrix_(mathematics))\n* [Min/Max Heap](https://github.com/arnauddri/algorithms/tree/master/data-structures/heap) [(wiki)](http://en.wikipedia.org/wiki/Heap_%28data_structure%29)\n* [Priority Queue](https://github.com/arnauddri/algorithms/tree/master/data-structures/priority-queue) [(wiki)](http://en.wikipedia.org/wiki/Priority_queue)\n* [Queue](https://github.com/arnauddri/algorithms/tree/master/data-structures/queue) [(wiki)](http://en.wikipedia.org/wiki/Queue_%28abstract_data_type%29)\n* [Stack](https://github.com/arnauddri/algorithms/tree/master/data-structures/stack) [(wiki)](http://en.wikipedia.org/wiki/Stack_%28abstract_data_type%29)\n\n#### Graph algorithms\n\n**Searching:**\n* [Depth First Search](https://github.com/arnauddri/algorithms/tree/master/algorithms/graphs/dfs) [(wiki)](http://en.wikipedia.org/wiki/Depth-first_search)\n* [Breadth First Search](https://github.com/arnauddri/algorithms/tree/master/algorithms/graphs/bfs) [(wiki)](http://en.wikipedia.org/wiki/Breadth-first_search)\n* [Kosaraju's Algorithm (find all SCCs)](https://github.com/arnauddri/algorithms/tree/master/algorithms/graphs/kosaraju) [(wiki)](http://en.wikipedia.org/wiki/Kosaraju%27s_algorithm)\n\n**Shortest path:**\n* [Breadth First Search Shortest Path](https://github.com/arnauddri/algorithms/tree/master/algorithms/graphs/bfs-shortest-path) [(wiki)](http://en.wikipedia.org/wiki/Breadth-first_search)\n* [Dijkstra](https://github.com/arnauddri/algorithms/tree/master/algorithms/graphs/dijkstra) [(wiki)](http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm)\n\n**Sorting:**\n* [Topological Sort](https://github.com/arnauddri/algorithms/tree/master/algorithms/graphs/topological-sort) [(wiki)](http://en.wikipedia.org/wiki/Topological_sorting)\n\n\n\n#### Maths algorithms\n\n* [Binary GCD algorithm](https://github.com/arnauddri/algorithms/tree/master/algorithms/maths/stein) [(wiki)](https://en.wikipedia.org/wiki/Binary_GCD_algorithm)\n* [Closest pairs](https://github.com/arnauddri/algorithms/tree/master/algorithms/maths/closest-pair) [(wiki)](http://en.wikipedia.org/wiki/Closest_pair_of_points_problem)\n* [FastPower](https://github.com/arnauddri/algorithms/tree/master/algorithms/maths/fast-power) [(wiki)](http://en.wikipedia.org/wiki/Exponentiation_by_squaring)\n* [Fibonacci](https://github.com/arnauddri/algorithms/tree/master/algorithms/maths/fibonacci) [(wiki)](http://en.wikipedia.org/wiki/Fibonacci_number)\n* [Fisher-Yates Shuffle](https://github.com/arnauddri/algorithms/tree/master/algorithms/maths/fisher-yates) [(wiki)](http://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle)\n* [Erastothenes Sieve](https://github.com/arnauddri/algorithms/tree/master/algorithms/maths/eratosthenes-sieve) [(wiki)](https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes)\n* [Extented GCD algorithm](https://github.com/arnauddri/algorithms/tree/master/algorithms/maths/euclide) [(wiki)](http://en.wikipedia.org/wiki/Extended_Euclidean_algorithm)\n* [Karatsuba's Multiplication](https://github.com/arnauddri/algorithms/tree/master/algorithms/maths/karatsuba) [(wiki)](http://en.wikipedia.org/wiki/Karatsuba_algorithm)\n* [Newton's Square Root](https://github.com/arnauddri/algorithms/tree/master/algorithms/maths/newton-sqrt) [(wiki)](http://en.wikipedia.org/wiki/Newton%27s_method)\n* [Permutations Count](https://github.com/arnauddri/algorithms/tree/master/algorithms/maths/permutations-count)\n* [Strassen's matrix multiplication](https://github.com/arnauddri/algorithms/tree/master/algorithms/maths/strassen) [(wiki)](http://en.wikipedia.org/wiki/Strassen_algorithm)\n* [Randomized Selection](https://github.com/arnauddri/algorithms/tree/master/algorithms/maths/RSelect)\n\n#### Sorting algorithms\n\n* [Bubble Sort](https://github.com/arnauddri/algorithms/tree/master/algorithms/sorting/bubble-sort) [(wiki)](http://en.wikipedia.org/wiki/Bubble_sort)\n* [Heap Sort](https://github.com/arnauddri/algorithms/tree/master/algorithms/sorting/heap-sort) [(wiki)](http://en.wikipedia.org/wiki/Heapsort)\n* [Quick Sort](https://github.com/arnauddri/algorithms/tree/master/algorithms/sorting/quick-sort) [(wiki)](http://en.wikipedia.org/wiki/Quicksort)\n* [Merge Sort](https://github.com/arnauddri/algorithms/tree/master/algorithms/sorting/merge-sort) [(wiki)](http://en.wikipedia.org/wiki/Merge_sort)\n* [Insertion Sort](https://github.com/arnauddri/algorithms/tree/master/algorithms/sorting/insertion-sort) [(wiki)](http://en.wikipedia.org/wiki/Insertion_sort)\n* [Shell Sort](https://github.com/arnauddri/algorithms/tree/master/algorithms/sorting/shell-sort) [(wiki)](http://en.wikipedia.org/wiki/Shellsort)\n* [Selection Sort](https://github.com/arnauddri/algorithms/tree/master/algorithms/sorting/selection-sort) [(wiki)](http://en.wikipedia.org/wiki/Selection_sort)\n\n#### Searching algorithms\n\n* [Binary Search](https://github.com/arnauddri/algorithms/tree/master/algorithms/searching/binary-search) [(wiki)](http://en.wikipedia.org/wiki/Binary_search_algorithm)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Farnauddri%2Falgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Farnauddri%2Falgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Farnauddri%2Falgorithms/lists"}