Add simple recursion examples: factorial, fibonacci, sum_of_digits by Toshaksha · Pull Request #12834 · TheAlgorithms/Python · GitHub
Skip to content

Add simple recursion examples: factorial, fibonacci, sum_of_digits - #12834

Open
Toshaksha wants to merge 4 commits into
TheAlgorithms:masterfrom
Toshaksha:simple-recursion-examples
Open

Toshaksha wants to merge 4 commits into
TheAlgorithms:masterfrom
Toshaksha:simple-recursion-examples

Conversation

@Toshaksha

Copy link
Copy Markdown

Describe your change:

  • Add an algorithm (simple recursion examples for beginners)

This pull request adds a new file: simple_recursion.py under the other/ directory.
It includes beginner-friendly recursive functions:

  • factorial(n)
  • fibonacci(n)
  • sum_of_digits(n)

Each function includes:

  • Python type hints
  • Proper docstrings with doctests
  • Basic error handling

External references:

Checklist:

  • I have read CONTRIBUTING.md.
  • This pull request is all my own work -- I have not plagiarized.
  • I know that pull requests will not be merged if they fail the automated tests.
  • This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
  • All new Python files are placed inside an existing directory.
  • All filenames are in all lowercase characters with no spaces or dashes.
  • All functions and variable names follow Python naming conventions.
  • All function parameters and return values are annotated with Python type hints.
  • All functions have doctests that pass the automated testing.
  • All new algorithms include at least one URL that points to Wikipedia or another similar explanation.
  • No issue is being resolved in this PR, so the issue-closing keyword is not included..

@Toshaksha

Copy link
Copy Markdown
Author

@Toshaksha

Copy link
Copy Markdown
Author

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Projects

None yet

Development

Successfully merging this pull request may close these issues.

5 participants