Merge pull request kelvins#145 from EuCarlos/main

Adicionado algoritmos e estrutura de dados em Ruby

Author: kelvins

README.md

@@ -92,8 +92,8 @@ Com o objetivo de alcançar uma abrangência maior e encorajar novas pessoas a c
                 </a>
             </td>
             <td> <!-- Ruby -->
-                <a href="./CONTRIBUTING.md">
-                    <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/github/github-original.svg" />
+                <a href="./src/ruby/algoritmo_dijkstra.rb">
+                    <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/ruby/ruby-original.svg" />
                 </a>
             </td>
             <td> <!-- JavaScript -->
@@ -498,8 +498,8 @@ Com o objetivo de alcançar uma abrangência maior e encorajar novas pessoas a c
                 </a>
             </td>
             <td> <!-- Ruby -->
-                <a href="./CONTRIBUTING.md">
-                    <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/github/github-original.svg" />
+                <a href="./src/ruby/interpolation_search.rb">
+                    <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/ruby/ruby-original.svg" />
                 </a>
             </td>
             <td> <!-- JavaScript -->
@@ -846,8 +846,8 @@ Com o objetivo de alcançar uma abrangência maior e encorajar novas pessoas a c
                 </a>
             </td>
             <td> <!-- Ruby -->
-                <a href="./CONTRIBUTING.md">
-                    <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/github/github-original.svg" />
+                <a href="./src/ruby/factorial.rb">
+                    <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/ruby/ruby-original.svg" />
                 </a>
             </td>
             <td> <!-- JavaScript -->
@@ -1020,8 +1020,8 @@ Com o objetivo de alcançar uma abrangência maior e encorajar novas pessoas a c
                 </a>
             </td>
             <td> <!-- Ruby -->
-                <a href="./CONTRIBUTING.md">
-                    <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/github/github-original.svg" />
+                <a href="./src/ruby/max_recursivo.rb">
+                    <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/ruby/ruby-original.svg" />
                 </a>
             </td>
             <td> <!-- JavaScript -->
@@ -1078,8 +1078,8 @@ Com o objetivo de alcançar uma abrangência maior e encorajar novas pessoas a c
                 </a>
             </td>
             <td> <!-- Ruby -->
-                <a href="./CONTRIBUTING.md">
-                    <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/github/github-original.svg" />
+                <a href="./src/ruby/min_max_iterativo.rb">
+                    <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/ruby/ruby-original.svg" />
                 </a>
             </td>
             <td> <!-- JavaScript -->
@@ -1136,8 +1136,8 @@ Com o objetivo de alcançar uma abrangência maior e encorajar novas pessoas a c
                 </a>
             </td>
             <td> <!-- Ruby -->
-                <a href="./CONTRIBUTING.md">
-                    <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/github/github-original.svg" />
+                <a href="./src/ruby/min_max_recursivo.rb">
+                    <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/ruby/ruby-original.svg" />
                 </a>
             </td>
             <td> <!-- JavaScript -->
@@ -1718,8 +1718,8 @@ Com o objetivo de alcançar uma abrangência maior e encorajar novas pessoas a c
                 </a>
             </td>
             <td> <!-- Ruby -->
-                <a href="./CONTRIBUTING.md">
-                    <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/github/github-original.svg" />
+                <a href="./src/ruby/deque.rb">
+                    <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/ruby/ruby-original.svg" />
                 </a>
             </td>
             <td> <!-- JavaScript -->
@@ -2706,8 +2706,8 @@ Com o objetivo de alcançar uma abrangência maior e encorajar novas pessoas a c
                 </a>
             </td>
             <td> <!-- Ruby -->
-                <a href="./CONTRIBUTING.md">
-                    <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/github/github-original.svg" />
+                <a href="./src/ruby/comb_sort.rb">
+                    <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/ruby/ruby-original.svg" />
                 </a>
             </td>
             <td> <!-- JavaScript -->
@@ -2822,8 +2822,8 @@ Com o objetivo de alcançar uma abrangência maior e encorajar novas pessoas a c
                 </a>
             </td>
             <td> <!-- Ruby -->
-                <a href="./CONTRIBUTING.md">
-                    <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/github/github-original.svg" />
+                <a href="./src/ruby/gnome_sort.rb">
+                    <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/ruby/ruby-original.svg" />
                 </a>
             </td>
             <td> <!-- JavaScript -->
@@ -3578,8 +3578,8 @@ Com o objetivo de alcançar uma abrangência maior e encorajar novas pessoas a c
                 </a>
             </td>
             <td> <!-- Ruby -->
-                <a href="./CONTRIBUTING.md">
-                    <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/github/github-original.svg" />
+                <a href="./src/ruby/calculate_pi.rb">
+                    <img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/ruby/ruby-original.svg" />
                 </a>
             </td>
             <td> <!-- JavaScript -->

src/ruby/algoritmo_dijkstra.rb

@@ -0,0 +1,51 @@
+# Algoritmo de Dijkstra em Ruby
+# Carlos Alves
+# https://github.com/EuCarlos
+
+def dijkstra(matrix, n)
+    visited = Array.new(n)
+
+    for i in 1..n-1
+        min, min_value = nil, nil
+
+        for j in 1..n-1
+            if !visited[j] && (!min_value || matrix[j][0] < min_value)
+                min = j
+                min_value = matrix[j][0]
+            end
+        end
+
+        visited[min] = true
+        
+        for j in 1..n-1
+            if matrix[min][0] + matrix[min][j] < matrix[j][0]
+                matrix[j][0] = matrix[min][0] + matrix[min][j]
+            end
+        end
+    end
+end
+
+def main
+    n_vertices = 5
+
+    matrix = []
+    ignore = 4294967295
+    
+    matrix.push([0, 6, 10, ignore, ignore])
+    matrix.push([6, 0, ignore, 2, ignore])
+    matrix.push([10, ignore, 0, 1, 3])
+    matrix.push([ignore, 2, 1, 0, 8])
+    matrix.push([ignore, ignore, 3, 8, 0])
+
+    matrix.to_a.each {|row| puts row.inspect}
+
+    dijkstra(matrix, n_vertices)
+
+    puts "============================================================"
+    puts "Total caminho mais curto do vertice 0 ao 4: #{matrix[4][0]}"
+    puts "============================================================"
+    
+    matrix.to_a.each {|row| puts row.inspect}
+end
+
+main()

src/ruby/calculate_pi.rb

@@ -0,0 +1,27 @@
+# Calculo do PI (Leibniz) em Ruby
+# Carlos Alves
+# https://github.com/EuCarlos
+
+def calculate_pi(number)
+    denominator = 1.0
+    operation = 1.0
+    pi = 0
+
+    for count in 1..number
+        pi += operation * (4.0 / denominator)
+        denominator += 2.0
+        operation *= -1.0
+    end
+
+    return pi
+end
+
+def main
+    terms = [10, 1000, 100000, 10000000]
+
+    terms.each do |term|
+        puts "PI #{term}: #{calculate_pi(term)}"
+    end
+end
+
+main()

src/ruby/comb_sort.rb

@@ -0,0 +1,28 @@
+# Algoritmo de Comb sort em Ruby
+# Carlos Alves
+# https://github.com/EuCarlos
+
+def comb_sort(arr)
+    gap = arr.length
+    shrink = 1.3
+    swapped = true
+
+    while gap > 1 || swapped do
+        gap = (gap / shrink).floor
+        gap = 1 if gap < 1
+        swapped = false
+
+        for i in 0..(arr.length - gap)-1
+            if arr[i] > arr[i + gap]
+                arr[i], arr[i + gap] = arr[i + gap], arr[i]
+                swapped = true
+            end
+        end
+    end
+
+    return arr
+end
+
+array = [86, 16, 10, 39, 49, 6, 32, 57, 72, 29]
+print "Lista: #{array} \n"
+print "Lista Ordenada: #{comb_sort(array)}"

src/ruby/deque.rb

@@ -0,0 +1,77 @@
+# Algoritmo Deque em Ruby
+# Carlos Alves
+# https://github.com/EuCarlos
+
+class Deque
+    attr_accessor :deque
+
+    def initialize(deque = [])
+        self.deque = deque
+    end
+
+    # adds an item in front of the deque:
+    def insert_front(value)
+        self.deque.unshift(value)
+    end
+
+    # adds an item in back of the deque:
+    def insert_last(value)
+        self.deque.push(value)
+    end
+
+    # adds an item in front of the deque:
+    def delete_front()
+        self.deque.shift() if self.deque.length != 0
+    end
+
+    # adds an item in back of the deque:
+    def delete_last()
+        self.deque.pop() if self.deque.length != 0
+    end
+
+    # gets the item at the front of the queue:
+    def read_front()
+        return self.deque.length >= 1 ? self.deque[0] : 'Lista está vazia'
+    end
+
+    # gets the item at the last of the queue:
+    def read_rear()
+        return self.deque.length >= 1 ? self.deque[-1] : 'Lista está vazia'
+    end
+
+    # checks whether deque is full or not
+    def is_full()
+        result = self.deque.length >= 1 ? 'está' : 'não esta'
+        return "Lista #{result} cheia!"
+    end
+
+    # checks whether deque is empty or not
+    def is_empty()
+        result = self.deque.length == 0 ? 'está' : 'não esta'
+        return "Lista #{result} vazia"
+    end
+end
+
+def main
+    # test with full list
+    deque = Deque.new([86, 16, 10, 39])
+
+    deque.insert_front(54)
+    deque.insert_last(91)
+
+    deque.delete_front
+    deque.delete_last
+
+    puts deque.read_front
+    puts deque.read_rear
+
+    puts deque.is_full
+    puts deque.is_empty
+
+    # test with empty list
+    deque_empty = Deque.new
+    puts deque_empty.is_full
+    puts deque_empty.is_empty
+end
+
+main()

src/ruby/factorial.rb

@@ -0,0 +1,21 @@
+
+# Fatorial em Ruby
+# Carlos Alves
+# https://github.com/EuCarlos
+
+def factorial(value)
+    aux = 1
+    for i in 1..value
+        aux *= i
+    end
+
+    return aux
+end
+
+def main
+    for number in 0..10
+        puts "#{number}! = #{factorial(number)}"
+    end
+end
+
+main()

src/ruby/gnome_sort.rb

@@ -0,0 +1,24 @@
+# Algoritmo Gnome sort em Ruby
+# Carlos Alves
+# https://github.com/EuCarlos
+
+def gnome_sort(array)
+    count = 0
+
+    while count < array.length - 1 do
+        if array[count] > array[count + 1]
+            array[count + 1], array[count] = array[count], array[count + 1]
+            count -= 2 if count > 0
+        end
+        count += 1
+    end
+    
+    return array
+end
+
+def main
+    array = [10, 8, 4, 3, 1, 9, 0, 2, 7, 5, 6]
+    print(gnome_sort(array))
+end
+
+main()

src/ruby/interpolation_search.rb

@@ -0,0 +1,33 @@
+# Algoritmo de Busca por interpolação em Ruby
+# Carlos Alves
+# https://github.com/EuCarlos
+
+def interpolation_search(value, data)
+    low = 0
+    high = data.length - 1
+    mid = ((data.length - 1) / 2).floor + low
+
+    while low < mid do
+        if data[mid] == value
+            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
+    
+    array_2 = [23, 9, 5, 78, 123, 5444, 54535, 64, 3, 12, 14, 15].sort
+    puts interpolation_search(5444, array_2) # 11° posição do array ordenado
+end
+
+main()