Adiciona Algoritmo de Dijkstra, Calculo do PI e Comb sort

Author: EuCarlos

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)}"