refactoring SelectionSort

Author: codelogicws

out/production/Algorithms/ws/codelogic/algorithms/sort/SelectionSort.class

@@ -26,4 +26,5 @@ public void set(Element toBeCopiedElement) {
         index = toBeCopiedElement.index;
         value = toBeCopiedElement.value;
     }
+
 }

src/ws/codelogic/algorithms/sort/Element.java

@@ -21,7 +21,7 @@ public void sort() {
 
     private void replaceWithSmallestUnsorted(){
         findSmallest();
-        exchangeCurrentWithLowest(stage.index);
+        exchangeCurrentWithLowest();
     }
 
     private void findSmallest(){
@@ -40,9 +40,9 @@ private void handleSmallerValues() {
         }
     }
 
-    private void exchangeCurrentWithLowest(int selected) {
-        array[lowest.index] = array[selected];
-        array[selected] = lowest.value;
+    private void exchangeCurrentWithLowest() {
+        array[stage.index] = lowest.value;
+        array[lowest.index] = stage.value;
     }
 
     public Comparable[] getArray() {