Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
10 changes: 8 additions & 2 deletions Algorithms/Math/Fibonacci.fs
Original file line number Diff line number Diff line change
@@ -1,7 +1,13 @@
namespace Algorithms.Math
namespace Algorithms.Math

module Fibonacci =
let rec PrintSerie (one: int) (two: int) =
let fibo = one + two
System.Console.WriteLine fibo
PrintSerie two fibo
PrintSerie two fibo

let rec NthFibonacci (n: int): int =
match n with
| 0 -> 0
| 1 -> 1
| n -> NthFibonacci (n-1) + NthFibonacci (n-2)
7 changes: 7 additions & 0 deletions Algorithms/Math/Greatest_Common_Divisor.fs
Original file line number Diff line number Diff line change
@@ -0,0 +1,7 @@
namespace Algorithms.Math

module GreatestCommonDivisor =
let rec gcd (m: int) (n: int): int =
match m,n with
| 0,n -> n
| m,n -> gcd (n % m) m
File renamed without changes.
1 change: 1 addition & 0 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -11,6 +11,7 @@ This repository contains algorithms and data structures implemented in F# for ed
+ [Abs Minimum](https://github.com/TheAlgorithms/F-Sharp/blob/main/Algorithms/Math/AbsMin.fs)
+ [Factorial](https://github.com/TheAlgorithms/F-Sharp/blob/main/Algorithms/Math/Factorial.fs)
+ [Fibonacci](https://github.com/TheAlgorithms/F-Sharp/blob/main/Algorithms/Math/Fibonacci.fs)
+ [Greatest Common Divisor](https://github.com/TheAlgorithms/F-Sharp/blob/main/Algorithms/Math/Greatest_Common_Divisor.fs)
+ [Perfect Numbers](https://github.com/TheAlgorithms/F-Sharp/blob/main/Algorithms/Math/Perfect_Numbers.fs)
+ [Power](https://github.com/TheAlgorithms/F-Sharp/blob/main/Algorithms/Math/Power.fs)
+ [Search](https://github.com/TheAlgorithms/F-Sharp/tree/main/Algorithms/Search)
Expand Down