Implement Selection Sort in Java and Ruby

Author: teinen

selection_sort/SelectionSort.java

@@ -0,0 +1,50 @@
+import java.util.*;
+
+/**
+ * SelectionSort
+ */
+public class SelectionSort {
+
+ public static void main(String[] args) {
+ int inputArr[] = {20, 13, 17, 15, 18, 16, 14, 19};
+
+ // variables
+ int i = 0;
+ int k = 0;
+ int idxMin = 0;
+ int w = 0;
+
+ int len = inputArr.length;
+
+ long start = System.nanoTime();
+
+ while(i < len - 1) {
+ idxMin = i;
+ k = i + 1;
+
+ while(k < len) {
+ if(inputArr[k] < inputArr[idxMin]) {
+ idxMin = k;
+
+ } else {
+ k++;
+ }
+
+ }
+ // change the min number
+ w = inputArr[i];
+
+ inputArr[i] = inputArr[idxMin];
+
+ inputArr[idxMin] = w;
+
+ i++;
+ }
+
+ System.out.println(Arrays.toString(inputArr));
+
+ long end = System.nanoTime();
+
+ System.out.println("Exec time: " + (end - start) / 1000000f + " ms");
+ }
+}

selection_sort/SelectionSort.rb

@@ -0,0 +1,41 @@
+require 'time'
+
+class SelectionSort
+ input_arr = [20, 13, 17, 15, 18, 16, 14, 19]
+
+ i = 0
+ k = 0
+ idxMin = 0
+ w = 0
+
+ len = input_arr.size
+
+ start_time = Time.now
+
+ while i < len - 1 do
+ idxMin = i
+ k = i + 1
+
+ while k < len do
+ if input_arr[k] < input_arr[idxMin]
+ idxMin = k
+ elsif
+ k += 1
+ end
+ end
+
+ w = input_arr[i]
+
+ input_arr[i] = input_arr[idxMin]
+
+ input_arr[idxMin] = w
+
+ i += 1
+ end
+
+ puts input_arr.to_s
+
+ end_time = Time.now
+
+ puts "Exec time: #{(end_time - start_time) * 100000} ms"
+end