diff --git a/algorithms-java/src/main/java/com/sl/algorithms/sort/generalpurpose/smalldata/SelectionSort.java b/algorithms-java/src/main/java/com/sl/algorithms/sort/generalpurpose/smalldata/SelectionSort.java
index 318565e3..52503565 100644
--- a/algorithms-java/src/main/java/com/sl/algorithms/sort/generalpurpose/smalldata/SelectionSort.java
+++ b/algorithms-java/src/main/java/com/sl/algorithms/sort/generalpurpose/smalldata/SelectionSort.java
@@ -6,11 +6,10 @@
import com.sl.algorithms.core.list.ListNode;
/**
- *
In-place quadratic-complexity sort algorithm, useful for small data-set.
Reference
- *
Approach: Given a list, take the current element and exchange it with the
- * smallest element on the right.
Usage: Small data-set / when 'write' operation
- * is expensive.
Inner Loop: operates on the Unsorted portion.
+ *
In-place quadratic-complexity algorithm, useful for small data-set.
+ *Given a list, take the current element and exchange it with the smallest element.
+ *Usage: Small data-set / when 'write' operation is expensive.
+ *Inner Loop: operates on the Unsorted portion.
*/ @SuppressWarnings("unchecked") public class SelectionSort${config.problem}
-${config.explanation.description}
- ${steps ? `