diff --git a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/utils/BinaryHeapFormatter.java b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/utils/BinaryHeapFormatter.java
index 4cfbaec..fc867d4 100644
--- a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/utils/BinaryHeapFormatter.java
+++ b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/utils/BinaryHeapFormatter.java
@@ -68,7 +68,7 @@ public class BinaryHeapFormatter {
         /**
          * Creates a new context by appending a branch to this context.
          * 
-         * @param n     Number of spaces to add to the margin, or {@code null} to use
+         * @param count     Number of spaces to add to the margin, or {@code null} to use
          *              the length of the string.
          * @param label Name of the branch.
          * 
@@ -156,13 +156,12 @@ public class BinaryHeapFormatter {
      * heap.
      * 
      * @param heap       The binary heap to display.
-//     * @param maxElement Maximum number of elements to display. or {@code -1} to
-//     *                   display all the elements.
+     * @param max_elements Maximum number of elements to display. or {@code -1} to
+     *                   display all the elements.
      * 
      * @return a string containing a sorted view the given binary heap.
      */
-    public static <E extends Comparable<E>> String toStringSorted(BinaryHeap<E> heap,
-            int max_elements) {
+    public static <E extends Comparable<E>> String toStringSorted(BinaryHeap<E> heap, int max_elements) {
         String result = "";
         final BinaryHeap<E> copy = new BinaryHeap<E>(heap);