https://github.com/bapjiws/haskell-tail-recursions

https://github.com/bapjiws/haskell-tail-recursions

Last synced: 2 months ago
JSON representation

• Host: GitHub
• URL: https://github.com/bapjiws/haskell-tail-recursions
• Owner: bapjiws
• Created: 2015-10-07T15:09:12.000Z (over 9 years ago)
• Default Branch: master
• Last Pushed: 2015-10-07T15:38:38.000Z (over 9 years ago)
• Last Synced: 2025-01-28T16:44:20.567Z (4 months ago)
• Language: Haskell
• Size: 285 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
This repository contains three tail recursive functions written in Haskell:

- **fibonacci** finds Fibonacci numbers (including negative ones)

- **seqA** finds the elements of the following recurrent sequence: a_0 = 1; a_1 = 2 ; a_2 = 3; a_{k+3} = a_{k+2} + a_{k+1} - 2 a_{k}

- **sum'n'count** returns the sum and the number of digits of a given integer