{"id":19945540,"url":"https://github.com/odilson-dev/project-recursion","last_synced_at":"2026-06-05T22:31:39.153Z","repository":{"id":197897926,"uuid":"699532065","full_name":"odilson-dev/project-recursion","owner":"odilson-dev","description":"The Fibonacci Sequence, which sums each number with the one before it, is a great example of a problem that can be solved recursively.","archived":false,"fork":false,"pushed_at":"2023-10-03T15:04:53.000Z","size":3,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-10-09T10:50:58.117Z","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/odilson-dev.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}},"created_at":"2023-10-02T20:22:31.000Z","updated_at":"2023-11-18T21:06:01.000Z","dependencies_parsed_at":"2024-01-03T20:41:36.695Z","dependency_job_id":null,"html_url":"https://github.com/odilson-dev/project-recursion","commit_stats":null,"previous_names":["odilsonjs/project-recursion","odilsoncode/project-recursion","odilson-dev/project-recursion"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/odilson-dev/project-recursion","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/odilson-dev%2Fproject-recursion","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/odilson-dev%2Fproject-recursion/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/odilson-dev%2Fproject-recursion/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/odilson-dev%2Fproject-recursion/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/odilson-dev","download_url":"https://codeload.github.com/odilson-dev/project-recursion/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/odilson-dev%2Fproject-recursion/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286079811,"owners_count":27282121,"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-26T02:00:06.075Z","response_time":193,"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-11-13T00:25:57.112Z","updated_at":"2025-11-26T22:01:46.458Z","avatar_url":"https://github.com/odilson-dev.png","language":"Ruby","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Project-recursion\n\nThe Fibonacci Sequence, which sums each number with the one before it, is a great example of a problem that can be solved recursively.\n\nIn mathematics, the Fibonacci sequence is a sequence in which each number is the sum of the two preceding ones. Numbers that are part of the Fibonacci sequence are known as Fibonacci numbers, commonly denoted Fn .\n\nThe sequence commonly starts from 0 and 1, although some authors start the sequence from 1 and 1 or sometimes (as did Fibonacci) from 1 and 2. Starting from 0 and 1, the first few values in the sequence are:[1]\n\n# Wikipedia\nhttps://en.wikipedia.org/wiki/Fibonacci_sequence\n\n\n\n# Merge sort\n\nIn computer science, merge sort (also commonly spelled as mergesort) is an efficient, general-purpose, and comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the relative order of equal elements is the same in the input and output.\n\nMerge sort is a divide-and-conquer algorithm that was invented by John von Neumann in 1945.[2] A detailed description and analysis of bottom-up merge sort appeared in a report by Goldstine and von Neumann as early as 1948.[3]\n\n# Wikipedia \nhttps://en.wikipedia.org/wiki/Merge_sort\n\n# Course Link\nhttps://www.theodinproject.com/lessons/ruby-recursion\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fodilson-dev%2Fproject-recursion","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fodilson-dev%2Fproject-recursion","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fodilson-dev%2Fproject-recursion/lists"}