* Implement Bubble Sort in Java, Ruby

* Modfy log comments

Author: teinen

bubble_sort/BubbleSort.java

@@ -0,0 +1,41 @@
+import java.util.*;
+
+/**
+ * BubbleSort
+ */
+public class BubbleSort {
+
+  public static void main(String[] args) {
+    int inputArr[] = {20, 13, 17, 15, 18, 16, 14, 19};
+
+    // variables
+    int len = inputArr.length;
+    int lastIdx = len - 1;
+    int i = 0;
+    int k = 0;
+    int w = 0;
+
+    long start = System.nanoTime();
+
+    System.out.println("=== Exec Bubble Sort in Java ===");
+
+    while(k < lastIdx) {
+      i = lastIdx;
+      while(i > k) {
+        if(inputArr[i - 1] > inputArr[i]) {
+          w = inputArr[i - 1];
+          inputArr[i - 1] = inputArr[i];
+          inputArr[i] = w;
+        }
+        i--;
+      }
+      k++;
+    }
+
+    System.out.println(Arrays.toString(inputArr));
+
+    long end = System.nanoTime();
+
+    System.out.println("Exec time: " + (end - start) / 1000000f + " ms");
+  }
+}

bubble_sort/BubbleSort.rb

@@ -0,0 +1,37 @@
+require 'time'
+
+class BubbleSort
+  input_arr = [20, 13, 17, 15, 18, 16, 14, 19]
+
+  # variables
+  len = input_arr.size
+  lastIdx = len - 1
+  i = 0
+  k = 0
+  w = 0
+
+  start_time = Time.now
+
+  puts "=== Exec Bubble Sort in Ruby ==="
+
+  while k < lastIdx
+    i = lastIdx
+
+    while i > k
+      if input_arr[i - 1] > input_arr[i]
+        w = input_arr[i - 1]
+        input_arr[i - 1] = input_arr[i]
+        input_arr[i] = w
+      end
+      i -= 1
+    end
+
+    k += 1
+  end
+
+  puts input_arr.to_s
+
+  end_time = Time.now
+
+  puts "Exec time: #{(end_time - start_time) * 100000} ms"
+end

selection_sort/SelectionSort.java

@@ -18,6 +18,8 @@ public static void main(String[] args) {
 
     long start = System.nanoTime();
 
+    System.out.println("=== Exec Selection Sort in Java ===");
+
     while(i < len - 1) {
       idxMin = i;
       k = i + 1;

selection_sort/SelectionSort.rb

@@ -12,6 +12,8 @@ class SelectionSort
 
   start_time = Time.now
 
+  puts "=== Exec Selection Sort in Ruby ==="
+
   while i < len - 1 do
     idxMin = i
     k = i + 1