WIP recursion

Author: mfbmina

README.md

@@ -34,3 +34,4 @@ With that in mind, Golang is a language with fewer abstractions when comparing t
 I believe to get a good understanding, you can follow this order:
 
 - [Concepts](https://github.com/mfbmina/data-structures-algorithms-go/blob/main/concepts)
+- [Recursion](https://github.com/mfbmina/data-structures-algorithms-go/blob/main/recursion) --- WIP

data-structures-algorithms-go

@@ -1,9 +1,11 @@
 package main
 
 import "github.com/mfbmina/data-structures-algorithms-go/concepts"
+import "github.com/mfbmina/data-structures-algorithms-go/recursion"
 
 func main() {
 	// conceptsExamples()
+	recursionExamples()
 }
 
 func conceptsExamples() {
@@ -16,3 +18,7 @@ func conceptsExamples() {
 	concepts.Structs()
 	concepts.Functions()
 }
+
+func recursionExamples() {
+	recursion.Basic(10)
+}

main.go

@@ -0,0 +1,23 @@
+package recursion
+
+import "fmt"
+
+// In short, recursion is when a function call itself.
+//
+// When using recursion is important to always have a stop condition
+// because if there isn't one, it will consume all your memory.
+func Basic(n int64) {
+	fmt.Println("Calculating fatorial for", n)
+	resp := fat(n)
+	fmt.Println("The response is", resp)
+}
+
+func fat(n int64) int64{
+	// stop condition
+	if n == 1 {
+		return 1
+	}
+
+	// calling itself again!
+	return n * fat(n - 1)
+}