Merge pull request #373 from LukasiJan-komo/translate-ruby-comments

Translate Ruby algorithm comments from Portuguese to English (resolves #185)

Author: kelvins

src/ruby/comb_sort.rb

@@ -1,6 +1,6 @@
 # frozen_string_literal: true
 
-# Algoritmo de Comb sort em Ruby
+# Comb Sort algorithm in Ruby
 # Carlos Alves
 # https://github.com/EuCarlos
 
@@ -26,5 +26,5 @@ def comb_sort(arr)
 end
 
 array = [86, 16, 10, 39, 49, 6, 32, 57, 72, 29]
-print "Lista: #{array} \n"
-print "Lista Ordenada: #{comb_sort(array)}"
+print "List: #{array} \n"
+print "Sorted List: #{comb_sort(array)}"

src/ruby/deque.rb

@@ -1,6 +1,6 @@
 # frozen_string_literal: true
 
-# Algoritmo Deque em Ruby
+# Deque algorithm in Ruby
 # Carlos Alves
 # https://github.com/EuCarlos
 
@@ -17,41 +17,41 @@ def insert_front(value)
     deque.unshift(value)
   end
 
-  # adds an item in back of the deque:
+  # adds an item at the back of the deque:
   def insert_last(value)
     deque.push(value)
   end
 
-  # adds an item in front of the deque:
+  # removes an item from the front of the deque:
   def delete_front
     deque.shift unless deque.empty?
   end
 
-  # adds an item in back of the deque:
+  # removes an item from the back of the deque:
   def delete_last
     deque.pop unless deque.empty?
   end
 
-  # gets the item at the front of the queue:
+  # gets the item at the front of the deque:
   def read_front
-    deque.length >= 1 ? deque[0] : "Lista está vazia"
+    deque.length >= 1 ? deque[0] : "List is empty"
   end
 
-  # gets the item at the last of the queue:
+  # gets the item at the back of the deque:
   def read_rear
-    deque.length >= 1 ? deque[-1] : "Lista está vazia"
+    deque.length >= 1 ? deque[-1] : "List is empty"
   end
 
-  # checks whether deque is full or not
+  # checks whether deque is full:
   def full?
-    result = deque.length >= 1 ? "está" : "não esta"
-    "Lista #{result} cheia!"
+    result = deque.length >= 1 ? "is" : "is not"
+    "List #{result} full!"
   end
 
-  # checks whether deque is empty or not
+  # checks whether deque is empty:
   def empty?
-    result = deque.empty? ? "está" : "não esta"
-    "Lista #{result} vazia"
+    result = deque.empty? ? "is" : "is not"
+    "List #{result} empty"
   end
 end
 

src/ruby/factorial_recursive.rb

@@ -1,18 +1,18 @@
 # frozen_string_literal: true
 
-def fatorial(number)
+def factorial(number)
   aux = 1
   (2..number).each do |x|
     aux *= x
   end
   aux
 end
 
-def fatorial_recursiva(number)
+def recursive_factorial(number)
   return 1 if number <= 1
 
-  n * fatorial_recursiva(number - 1)
+  number * recursive_factorial(number - 1)
 end
 
-puts fatorial(5)
-puts fatorial_recursiva(5)
+puts factorial(5)
+puts recursive_factorial(5)