{"id":37152147,"url":"https://github.com/briwilcox/algos","last_synced_at":"2026-01-14T17:58:04.290Z","repository":{"id":73523191,"uuid":"58249100","full_name":"briwilcox/algos","owner":"briwilcox","description":"Learning go through algorithms","archived":false,"fork":false,"pushed_at":"2016-05-15T21:09:02.000Z","size":28,"stargazers_count":6,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2024-06-20T02:11:58.347Z","etag":null,"topics":["binary-trees","bubble-sort","insertion-sort","quicksort","selection-sort"],"latest_commit_sha":null,"homepage":"","language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/briwilcox.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2016-05-07T04:26:37.000Z","updated_at":"2023-02-01T23:26:00.000Z","dependencies_parsed_at":"2024-06-20T01:45:34.080Z","dependency_job_id":null,"html_url":"https://github.com/briwilcox/algos","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/briwilcox/algos","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/briwilcox%2Falgos","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/briwilcox%2Falgos/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/briwilcox%2Falgos/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/briwilcox%2Falgos/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/briwilcox","download_url":"https://codeload.github.com/briwilcox/algos/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/briwilcox%2Falgos/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28429107,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-14T16:38:47.836Z","status":"ssl_error","status_checked_at":"2026-01-14T16:34:59.695Z","response_time":107,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["binary-trees","bubble-sort","insertion-sort","quicksort","selection-sort"],"created_at":"2026-01-14T17:58:03.629Z","updated_at":"2026-01-14T17:58:04.282Z","avatar_url":"https://github.com/briwilcox.png","language":"Go","readme":"# Algorithms\r\nReviewing algorithms, learning go. Images from wikipedia. \r\n\r\n## Search\r\n* Binary Search\r\n\r\n![Binary search](https://upload.wikimedia.org/wikipedia/commons/f/f7/Binary_search_into_array.png)\r\n\r\n## Sorting\r\n\r\n### Exchange Sorts:\r\n* Bubble Sort\r\n\r\n![Bubble Sort](https://upload.wikimedia.org/wikipedia/commons/3/37/Bubble_sort_animation.gif)\r\n* Odd Even Sort\r\n\r\n![Odd - Even Sort](https://upload.wikimedia.org/wikipedia/commons/1/1b/Odd_even_sort_animation.gif)\r\n* Quicksort\r\n\r\n![Quick Sort](https://upload.wikimedia.org/wikipedia/commons/6/6a/Sorting_quicksort_anim.gif)\r\n\r\n### Selection Sorts\r\n* Selection Sort\r\n\r\n![Selection Sort](https://upload.wikimedia.org/wikipedia/commons/b/b0/Selection_sort_animation.gif)\r\n\r\n### Insertion Sorts\r\n* Insertion Sort\r\n\r\n![Insertion Sort](https://upload.wikimedia.org/wikipedia/commons/2/25/Insertion_sort_animation.gif)\r\n\r\n### Merge Sorts\r\n* Merge Sort\r\n\r\n![Merge Sort](https://upload.wikimedia.org/wikipedia/commons/c/c5/Merge_sort_animation2.gif)\r\n\r\n## Primality\r\n\r\n* Naive Primality\r\n\r\n* Sieve of Eratosthenes\r\n\r\n![Sieve of Eratosthenes](https://upload.wikimedia.org/wikipedia/commons/b/b9/Sieve_of_Eratosthenes_animation.gif)\r\n\r\n## Graphs\r\n\r\n### Trees\r\n\r\n#### Binary trees \r\n\r\nCreation, insertion, searching, and simultaneously searching via go routines. Taken from golang.org\r\n\r\n![Binary Trees](https://upload.wikimedia.org/wikipedia/commons/b/bb/Binary_tree_traversion.svg)\r\n\r\n\r\n# Outputs\r\n\r\n## Search\r\n\r\n### Binary Search\r\n\r\nBinary Search:\r\n* Search Space:  [0 1 2 3 4 5 6 7 8 9]\r\n* a[ 9 ] =  9\r\n\r\nBinary Search:\r\n* Search Space:  [0 1 2 3 4 5 6 7 8 9]\r\n* a[ 2 ] =  2\r\n\r\nBinary Search:\r\n* Search Space:  [0 1 2 3 4 5 6 7 8 9]\r\n* 15 was not found\r\n\r\nBinary Search:\r\n* Search Space:  [0 1 2 3 4 5 6 7 8 9]\r\n* a[ 5 ] =  5\r\n\r\nBinary Search:\r\n* Search Space:  [0 1 2 3 4 5 6 7 8 9]\r\n* 10 was not found\r\n\r\n## Sort\r\n\r\n### Quicksort\r\n\r\nUnsorted: \r\n* [9 8 7 6 5 4 3 2 1 0]\r\n\r\nSorted via Quicksort: \r\n* [0 1 2 3 4 5 6 7 8 9]\r\n\r\nUnsorted: \r\n* [0 9 3 5 4 1 6 7 8 2]\r\n\r\nSorted via Quicksort: \r\n* [0 1 2 3 4 5 6 7 8 9]","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbriwilcox%2Falgos","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbriwilcox%2Falgos","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbriwilcox%2Falgos/lists"}