https://github.com/odilson-dev/project-recursion

The Fibonacci Sequence, which sums each number with the one before it, is a great example of a problem that can be solved recursively.
https://github.com/odilson-dev/project-recursion

Last synced: 2 days ago
JSON representation

The Fibonacci Sequence, which sums each number with the one before it, is a great example of a problem that can be solved recursively.

• Host: GitHub
• URL: https://github.com/odilson-dev/project-recursion
• Owner: odilson-dev
• Created: 2023-10-02T20:22:31.000Z (about 1 year ago)
• Default Branch: main
• Last Pushed: 2023-10-03T15:04:53.000Z (about 1 year ago)
• Last Synced: 2024-05-17T15:26:42.442Z (6 months ago)
• Language: Ruby
• Size: 2.93 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Project-recursion

The Fibonacci Sequence, which sums each number with the one before it, is a great example of a problem that can be solved recursively.

In 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 .

The 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]

# Wikipedia

https://en.wikipedia.org/wiki/Fibonacci_sequence

# Merge sort

In 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.

Merge 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]

# Wikipedia 

https://en.wikipedia.org/wiki/Merge_sort

# Course Link

https://www.theodinproject.com/lessons/ruby-recursion