Fix some ruby files using rubocop

Author: kelvins

src/ruby/ExponenciacaoTest.rb

@@ -5,7 +5,7 @@
 
 # the easiest implementation would be using .reverse method
 
-def is_palindrome(string)
+def palindrome?(string)
   return true if string.size == 1 || string.empty?
 
   reversed = ''
@@ -17,8 +17,8 @@ def is_palindrome(string)
   reversed == string
 end
 
-assert_equal is_palindrome('abba'), true
-assert_equal is_palindrome('abbas'), false
-assert_equal is_palindrome('tattarrattat'), true
-assert_equal is_palindrome('Was it a palindrome?'), false
-assert_equal is_palindrome('No lemon, no melon'), true
+assert_equal palindrome?('abba'), true
+assert_equal palindrome?('abbas'), false
+assert_equal palindrome?('tattarrattat'), true
+assert_equal palindrome?('Was it a palindrome?'), false
+assert_equal palindrome?('No lemon, no melon'), true

src/ruby/Palindromo.rb

@@ -1,5 +1,6 @@
 # frozen_string_literal: true
 
+# Sort an array using the BubbleSort algorithm
 class Bubblesort
   attr_reader :array_sorted
 

src/ruby/bubble_sort.rb

@@ -2,12 +2,13 @@
 
 require_relative './insertion_sort'
 
-class Bucketsort
+# Sort an array using the BucketSort algorithm
+class BucketSort
   attr_reader :array_sorted
 
   def initialize
     @array_sorted = []
-    @insertion = Insertionsort.new
+    @insertion = InsertionSort.new
   end
 
   def init(array)
@@ -41,6 +42,6 @@ def bucket_sort(array, bucket_size)
 end
 
 # test
-bu_s = Bucketsort.new
+bu_s = BucketSort.new
 bu_s.init([1, 4, 10, 2, 3, 32, 0])
 p bu_s.array_sorted

src/ruby/bucket_sort.rb

@@ -1,6 +1,7 @@
 # frozen_string_literal: true
 
-class Countsort
+# Sort an array using the CountSort algorithm
+class CountSort
   attr_reader :array_sorted
 
   def initialize
@@ -47,6 +48,6 @@ def count_sort(array, min, max)
 end
 
 # test
-c_s = Countsort.new
+c_s = CountSort.new
 c_s.init([1, 4, 10, 2, 3, 32, 0])
 p c_s.array_sorted

src/ruby/BuscaSentinela.rb renamed to src/ruby/busca_sentinela.rb

@@ -42,13 +42,13 @@ def read_rear
   end
 
   # checks whether deque is full or not
-  def is_full
+  def full?
     result = deque.length >= 1 ? 'está' : 'não esta'
     "Lista #{result} cheia!"
   end
 
   # checks whether deque is empty or not
-  def is_empty
+  def empty?
     result = deque.empty? ? 'está' : 'não esta'
     "Lista #{result} vazia"
   end
@@ -67,13 +67,13 @@ def main
   puts deque.read_front
   puts deque.read_rear
 
-  puts deque.is_full
-  puts deque.is_empty
+  puts deque.full?
+  puts deque.empty?
 
   # test with empty list
   deque_empty = Deque.new
-  puts deque_empty.is_full
-  puts deque_empty.is_empty
+  puts deque_empty.full?
+  puts deque_empty.empty?
 end
 
 main

src/ruby/BuscaSequencial.rb renamed to src/ruby/busca_sequencial.rb

@@ -1,5 +1,6 @@
 # frozen_string_literal: true
 
+# Sort an array using the HeapSort algorithm
 class Heapsort
   attr_reader :array_sorted
 

src/ruby/Busca_Sequencial_Recursiva.rb renamed to src/ruby/busca_sequencial_recursiva.rb

@@ -1,6 +1,7 @@
 # frozen_string_literal: true
 
-class Insertionsort
+# Sort an array using the InsertionSort algorithm
+class InsertionSort
   attr_reader :array_sorted
 
   def initialize
@@ -30,6 +31,6 @@ def insertion_sort(array, compare = ->(a, b) { a <=> b })
 end
 
 # test
-i_s = Insertionsort.new
+i_s = InsertionSort.new
 i_s.init([1, 4, 10, 2, 3, 32, 0])
 p i_s.array_sorted

src/ruby/count_sort.rb

@@ -14,22 +14,20 @@ def interpolation_search(value, data)
       return "Elemento encontrado na #{high}° posição do array ordenado."
     elsif value > data[mid]
       low = mid
-      high = high
       mid = ((high - low) / 2).floor + low
     else
-      low = low
       high = mid
       mid = ((high - low) / 2).floor + low
     end
   end
 end
 
 def main
-  array_1 = [37, 53, 1, 43, 11, 49, 32, 55, 40, 47, 25, 4].sort
-  puts interpolation_search(43, array_1) # 8° posição do array ordenado
+  array1 = [37, 53, 1, 43, 11, 49, 32, 55, 40, 47, 25, 4].sort
+  puts interpolation_search(43, array1) # 8° posição do array ordenado
 
-  array_2 = [23, 9, 5, 78, 123, 5444, 54_535, 64, 3, 12, 14, 15].sort
-  puts interpolation_search(5444, array_2) # 11° posição do array ordenado
+  array2 = [23, 9, 5, 78, 123, 5444, 54_535, 64, 3, 12, 14, 15].sort
+  puts interpolation_search(5444, array2) # 11° posição do array ordenado
 end
 
 main

src/ruby/deque.rb

@@ -1,6 +1,7 @@
 # frozen_string_literal: true
 
-class Mergesort
+# Sort an array using the MergeSort algorithm
+class MergeSort
   attr_reader :array_sorted
 
   def initialize
@@ -44,6 +45,6 @@ def merge(left, right)
 end
 
 # test
-m = Mergesort.new
+m = MergeSort.new
 m.init([1, 4, 10, 2, 3, 32, 0])
 p m.array_sorted

src/ruby/ExponenciacaoRecursiva.rb renamed to src/ruby/exponenciacao_recursiva.rb

@@ -1,5 +1,6 @@
 # frozen_string_literal: true
 
+# Sort an array using the QuickSort algorithm
 class Quicksort
   attr_reader :array_sorted
 

src/ruby/heap_sort.rb

@@ -1,6 +1,7 @@
 # frozen_string_literal: true
 
-class Radixsort
+# Sort an array using the RadixSort algorithm
+class RadixSort
   attr_reader :array_sorted
 
   def initialize
@@ -56,6 +57,6 @@ def radix(array, exp = 0)
 end
 
 # test
-r_s = Radixsort.new
+r_s = RadixSort.new
 r_s.init([1, 4, 10, 2, 3, 32, 0])
 p r_s.array_sorted

src/ruby/insertion_sort.rb

@@ -1,6 +1,7 @@
 # frozen_string_literal: true
 
-class Selectionsort
+# Sort an array using the SelectionSort algorithm
+class SelectionSort
   attr_reader :array_sorted
 
   def initialize
@@ -13,11 +14,11 @@ def init(array)
 
   private
 
-  def selection_sort(array, n)
-    n.times do |i|
+  def selection_sort(array, size)
+    size.times do |i|
       index_min = i
 
-      (i + 1).upto(n) do |j|
+      (i + 1).upto(size) do |j|
         index_min = j if array[j] < array[index_min]
       end
       array[i], array[index_min] = array[index_min], array[i] if index_min != i
@@ -27,6 +28,6 @@ def selection_sort(array, n)
 end
 
 # test
-s_s = Selectionsort.new
+s_s = SelectionSort.new
 s_s.init([1, 4, 10, 2, 3, 32, 0])
 p s_s.array_sorted