Documentation: adding description for WaveSort

Author: alxklm

src/main/java/com/thealgorithms/sorts/WaveSort.java

@@ -2,8 +2,16 @@
 
 /**
  * The WaveSort algorithm sorts an array so that every alternate element is greater than its adjacent elements.
+ * This implementation also provides a method to check if an array is wave sorted.
  */
 public class WaveSort implements SortAlgorithm {
+    /**
+     * Sorts the given array such that every alternate element is greater than its adjacent elements.
+     *
+     * @param array The array to be sorted.
+     * @param <T> The type of elements in the array, which must be Comparable.
+     * @return The sorted array.
+     */
     @Override
     public <T extends Comparable<T>> T[] sort(T[] array) {
         for (int i = 0; i < array.length; i += 2) {
@@ -17,6 +25,13 @@ public <T extends Comparable<T>> T[] sort(T[] array) {
         return array;
     }
 
+    /**
+     * Checks if the given array is wave sorted. An array is wave sorted if every alternate element is greater than its adjacent elements.
+     *
+     * @param array The array to check.
+     * @param <T> The type of elements in the array, which must be Comparable.
+     * @return true if the array is wave sorted, false otherwise.
+     */
     public <T extends Comparable<T>> boolean isWaveSorted(T[] array) {
         for (int i = 0; i < array.length; i += 2) {
             if (i > 0 && SortUtils.less(array[i], array[i - 1])) {