Update PriorityQueueSort.java

Author: Rahul-150705

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

@@ -5,24 +5,22 @@
 /**
  * Sorts an array using Java's PriorityQueue (Min-Heap).
  *
- * <p>Example:
- * Input: [7, 2, 9, 4, 1]
- * Output: [1, 2, 4, 7, 9]
+ * <p>Example: Input: [7, 2, 9, 4, 1] Output: [1, 2, 4, 7, 9]
  *
  * <p>Time Complexity:
  * - Inserting n elements into the PriorityQueue → O(n log n)
  * - Polling n elements → O(n log n)
  * - Total: O(n log n)
  *
- * Space Complexity: O(n) for the PriorityQueue
+ * <p>Space Complexity: O(n) for the PriorityQueue
  *
- * @see <a href="https://en.wikipedia.org/wiki/Heap_(data_structure)">Heap / PriorityQueue</a>
+ * @see <a href="https://en.wikipedia.org/wiki/Heap_(data_structure)">
+ *     Heap / PriorityQueue</a>
  */
 public final class PriorityQueueSort {
 
     // Private constructor to prevent instantiation (utility class)
-    private PriorityQueueSort() {
-    }
+    private PriorityQueueSort() {}
 
     /**
      * Sorts the given array in ascending order using a PriorityQueue.