{"id":16688073,"url":"https://github.com/danielpclark/algorithm_practice","last_synced_at":"2025-10-20T07:56:34.968Z","repository":{"id":28664530,"uuid":"32184114","full_name":"danielpclark/algorithm_practice","owner":"danielpclark","description":"Practicing examples from \"Introduction to The Design \u0026 Analysis of Algorithms\"","archived":false,"fork":false,"pushed_at":"2017-10-13T09:20:45.000Z","size":8,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-01-20T12:46:25.605Z","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/danielpclark.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":"2015-03-13T22:28:50.000Z","updated_at":"2017-10-13T09:20:46.000Z","dependencies_parsed_at":"2022-08-02T12:00:47.882Z","dependency_job_id":null,"html_url":"https://github.com/danielpclark/algorithm_practice","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danielpclark%2Falgorithm_practice","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danielpclark%2Falgorithm_practice/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danielpclark%2Falgorithm_practice/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danielpclark%2Falgorithm_practice/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/danielpclark","download_url":"https://codeload.github.com/danielpclark/algorithm_practice/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243447642,"owners_count":20292455,"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-10-12T15:26:45.711Z","updated_at":"2025-10-20T07:56:34.914Z","avatar_url":"https://github.com/danielpclark.png","language":"Ruby","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Algorithm Practice\nPracticing examples from \"Introduction to The Design \u0026amp; Analysis of Algorithms\" by Anany Levitin\n\nI'm following the examples provided in the book.  If pseudo code is presented I\nwrite it in Ruby in the exact same form it is presented.  If only the steps are provided\nI implement the steps as I perceive them.  The more general the description the more my\nimplementation my vary.\n\nAll algorithms have Minitest tests written for them.  The tests are written to adhere to\nthe examples given in the book.  If no example is given then a generic one is researched and made.\n\n# Contribution\nI'm very open to receiving tips and new knowledge for any algorithm.  That does not mean I'll\nchange the code for it.  If the book has pseudo code, then the algorithm will stay as implemented.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdanielpclark%2Falgorithm_practice","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdanielpclark%2Falgorithm_practice","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdanielpclark%2Falgorithm_practice/lists"}