refactor: use method SortUtils.swap (TheAlgorithms#4946)

png261 · vil02 · web-flow · commit e5f3d232c9fb · 2023-10-30T23:09:43.000+01:00
* refactor: use method SortUtils.swap

* fix: clang format

* style: explicitly import `swap`

---------

Co-authored-by: Piotr Idzik &lt;65706193+vil02@users.noreply.github.com&gt;
diff --git a/src/main/java/com/thealgorithms/sorts/SelectionSort.java b/src/main/java/com/thealgorithms/sorts/SelectionSort.java
@@ -1,5 +1,7 @@
 package com.thealgorithms.sorts;
 
+import static com.thealgorithms.sorts.SortUtils.swap;
+
 public class SelectionSort implements SortAlgorithm {
 
     /**
@@ -20,9 +22,7 @@ public <T extends Comparable<T>> T[] sort(T[] arr) {
                 }
             }
             if (minIndex != i) {
-                T temp = arr[i];
-                arr[i] = arr[minIndex];
-                arr[minIndex] = temp;
+                swap(arr, i, minIndex);
             }
         }
         return arr;

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,7 @@`
`1`	`1`	`package com.thealgorithms.sorts;`
`2`	`2`
	`3`	`+import static com.thealgorithms.sorts.SortUtils.swap;`
	`4`	`+`
`3`	`5`	`public class SelectionSort implements SortAlgorithm {`
`4`	`6`
`5`	`7`	`/**`
`@@ -20,9 +22,7 @@ public <T extends Comparable<T>> T[] sort(T[] arr) {`
`20`	`22`	`}`
`21`	`23`	`}`
`22`	`24`	`if (minIndex != i) {`
`23`		`- T temp = arr[i];`
`24`		`- arr[i] = arr[minIndex];`
`25`		`- arr[minIndex] = temp;`
	`25`	`+ swap(arr, i, minIndex);`
`26`	`26`	`}`
`27`	`27`	`}`
`28`	`28`	`return arr;`