{"id":33134943,"url":"https://github.com/Djo/algorithms","last_synced_at":"2025-11-20T04:02:09.307Z","repository":{"id":12364292,"uuid":"15013785","full_name":"djo/algorithms","owner":"djo","description":"Basic Algorithms written in Ruby","archived":false,"fork":false,"pushed_at":"2014-03-27T08:03:23.000Z","size":230,"stargazers_count":72,"open_issues_count":0,"forks_count":13,"subscribers_count":6,"default_branch":"master","last_synced_at":"2025-06-01T15:48:45.750Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Ruby","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/djo.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":"2013-12-07T22:09:34.000Z","updated_at":"2022-06-15T21:21:19.000Z","dependencies_parsed_at":"2022-09-23T05:51:48.807Z","dependency_job_id":null,"html_url":"https://github.com/djo/algorithms","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/djo/algorithms","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/djo%2Falgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/djo%2Falgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/djo%2Falgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/djo%2Falgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/djo","download_url":"https://codeload.github.com/djo/algorithms/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/djo%2Falgorithms/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":285369043,"owners_count":27159982,"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-11-20T02:00:05.334Z","response_time":54,"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":"2025-11-15T10:00:48.326Z","updated_at":"2025-11-20T04:02:09.279Z","avatar_url":"https://github.com/djo.png","language":"Ruby","funding_links":[],"categories":["Other Learning Materials"],"sub_categories":["Other frameworks and tools"],"readme":"## Basic Algorithms written in Ruby\n[![Build Status](https://secure.travis-ci.org/Djo/algorithms.png \"Build Status\")](http://travis-ci.org/Djo/algorithms)\n\n#### Fundamentals\n\n* [The greatest common divisor](lib/gcd.rb)\n* [Transpose of a matrix in Linear Algebra](lib/matrix.rb)\n* [Find the k-th smallest value in the array](lib/find_kth.rb)\n* [Work with a linked list](lib/linked_list.rb)\n* [Dijkstra's two-stack algorithm for expression evaluation](lib/expressions.rb)\n* [Union-find algorithm (weighted quick-union implementation)](lib/union_find.rb)\n\n#### Sorting\n\n* [Selection sort](lib/selection_sort.rb)\n* [Insertion sort](lib/insertion_sort.rb)\n* [Shell sort](lib/shell_sort.rb)\n* [Top-down mergesort](lib/merge_sort.rb)\n* [Bottom-up mergesort of a linked list](lib/merge_sort_bu.rb)\n* [Quick sort](lib/quick_sort.rb)\n* [Quick 3-way sort](lib/quick3way_sort.rb)\n* [Heap sort](lib/heap_sort.rb)\n* [Max-oriented priority queue](lib/priority_queue.rb)\n\n#### Searching\n\n* [Check if a binary tree is balanced](lib/btree.rb)\n* [Find the 'next' node (in-order successor) of a given node in a binary search tree](lib/bst.rb)\n\n#### Graphs\n\n* [Depth-first search](lib/dfs.rb)\n* [Finding a directed cycle](lib/directed_cycle.rb)\n\n#### Strings\n\n* [Least-significant-digit first string sort](lib/lsd.rb)\n\nDevelopment:\n\n    bundle install\n    bundle exec rake test\n\nCopyright (C) 2013-2014 [Andrew Djoga](http://andrewdjoga.com), released under the MIT license.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2FDjo%2Falgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2FDjo%2Falgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2FDjo%2Falgorithms/lists"}