From ea5bfb9301fae1713e97a1b9ff80a46ec6bd50b7 Mon Sep 17 00:00:00 2001
From: badkaktus <kolyuchy@gmail.com>
Date: Mon, 7 Oct 2019 13:55:48 +0300
Subject: [PATCH] =?UTF-8?q?=D1=80=D0=B5=D0=BA=D1=83=D1=80=D1=81=D0=B8?=
 =?UTF-8?q?=D1=8F?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 examples/recursion/recursion.go | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/examples/recursion/recursion.go b/examples/recursion/recursion.go
index a88b1e5..52ab4b2 100644
--- a/examples/recursion/recursion.go
+++ b/examples/recursion/recursion.go
@@ -1,13 +1,13 @@
-// Go supports
-// <a href="http://en.wikipedia.org/wiki/Recursion_(computer_science)"><em>recursive functions</em></a>.
-// Here's a classic factorial example.
+// Go поддерживает
+// <a href="http://en.wikipedia.org/wiki/Recursion_(computer_science)"><em>рекурсивные функции</em></a>.
+// Ниже приведено классическое вычисление факториала.
 
 package main
 
 import "fmt"
 
-// This `fact` function calls itself until it reaches the
-// base case of `fact(0)`.
+// Фукция `fact` вызывает себя по не достигнет
+// `fact(0)`.
 func fact(n int) int {
 	if n == 0 {
 		return 1