Fix some ruby files using rubocop

Author: kelvins

src/ruby/Fatorial.rb

@@ -1,15 +1,15 @@
 # frozen_string_literal: true
 
-def Hanoi(pin0, pin2, pin1, num)
+def hanoi(pin0, pin2, pin1, num)
   if num == 1
     # Show the operations
     print 'Move from ', pin0, ' to ', pin2, "\n"
   else
-    Hanoi(pin0, pin1, pin2, num - 1)
-    Hanoi(pin0, pin2, pin1, 1)
-    Hanoi(pin1, pin2, pin0, num - 1)
+    hanoi(pin0, pin1, pin2, num - 1)
+    hanoi(pin0, pin2, pin1, 1)
+    hanoi(pin1, pin2, pin0, num - 1)
   end
 end
 
 # Move from Pin-0 to Pin-2 using Pin-1 as helper (number of disks = 3)
-Hanoi(0, 2, 1, 3)
+hanoi(0, 2, 1, 3)

src/ruby/Hanoi.rb

@@ -1,5 +1,6 @@
 # frozen_string_literal: true
 
+# Class to represent each node from the linked list
 class Node
   attr_accessor :data, :next, :previous
 
@@ -10,6 +11,7 @@ def initialize(data)
   end
 end
 
+# Implement a doubly linked list
 class DoublyLinkedList
   def initialize
     @head = nil

src/ruby/Lista_duplamente_encadeada.rb

@@ -1,5 +1,6 @@
 # frozen_string_literal: true
 
+# Class that represents each node from the linked list
 class Node
   attr_accessor :data, :next
 
@@ -9,6 +10,7 @@ def initialize(data)
   end
 end
 
+# Implement the linked list data structure
 class LinkedList
   def initialize
     @head = nil

src/ruby/Lista_encadeada.rb

@@ -9,22 +9,5 @@ def busca_sequencial(valor, vetor)
   -1
 end
 
-# Teste Manual
 vetor = [1, 4, 5, 2, 42, 34, 54, 98, 89, 78, 67]
 puts busca_sequencial(98, vetor)
-
-# Teste Automatizado
-require 'minitest/autorun'
-
-class Test < Minitest::Test
-  def test_busca_sequencial_quando_nao_encontra_o_valor
-    assert_equal busca_sequencial(5, []), -1
-  end
-
-  def test_busca_sequencial_quando_encontra_os_valores
-    vetor = [1, 4, 5, 2, 42, 34, 54, 98, 89, 78, 67]
-    vetor.each_with_index do |elemento, indice|
-      assert_equal busca_sequencial(elemento, vetor), indice
-    end
-  end
-end

src/ruby/busca_sequencial.rb

@@ -4,6 +4,7 @@
 # Carlos Alves
 # https://github.com/EuCarlos
 
+# Implement Deque data structure
 class Deque
   attr_accessor :deque
 

src/ruby/deque.rb

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

src/ruby/fatorial.rb

@@ -1,23 +1,23 @@
 # frozen_string_literal: true
 
-def fibonacci(n)
+def fibonacci(number)
   last = 0
   curr = 1
-  (0..n - 1).each do |_|
+  (0..number - 1).each do |_|
     swap = curr
     curr += last
     last = swap
   end
   last
 end
 
-def fibonacci_recursiva(n)
-  if n <= 0
+def fibonacci_recursiva(number)
+  if number <= 0
     0
-  elsif n == 1
+  elsif number == 1
     1
   else
-    fibonacci(n - 1) + fibonacci(n - 2)
+    fibonacci(number - 1) + fibonacci(number - 2)
   end
 end
 

src/ruby/Fibonacci.rb renamed to src/ruby/fibonacci.rb

@@ -1,5 +1,6 @@
 # frozen_string_literal: true
 
+# Implements a Queue data structure
 class Queue
   def initialize
     @queue = []

src/ruby/Fila.rb renamed to src/ruby/fila.rb

@@ -1,5 +1,6 @@
 # frozen_string_literal: true
 
+# Implement the Stack data structure
 class Stack
   def initialize
     @stack = []