Fix export for Insertionsort, Improve formatting for exports

Author: moritzfl

src/main/java/de/moritzf/sorting/logic/sorting/BubbleSort.java

@@ -182,7 +182,7 @@ public int getProtocolSize() {
     public String protocol2LaTeX() {
         String retString = "";
         for (int i = 0; i < protocol.size(); i++) {
-            retString += " " + this.step2LaTeX(i) + "\n\\newline \n\\newline \n";
+            retString += this.step2LaTeX(i) + "\n\n";
         }
 
         return retString;

src/main/java/de/moritzf/sorting/logic/sorting/HeapSort.java

@@ -344,7 +344,7 @@ public String step2LaTeX(int chosenStepNumber) {
         if (chosenStepNumber == 0) {
             retString += "\\underline{\\textbf{Heap Creation}}\n\n original binary tree \n\n";
         } else if (chosenStepNumber == 1) {
-            retString += "$\\boxed{Zahl}$ := element that is to be heapified \n\n";
+            retString += "$\\boxed{number}$ := element that is to be heapified \n\n";
         }
 
 		/*

src/main/java/de/moritzf/sorting/logic/sorting/InsertionSort.java

@@ -114,8 +114,17 @@ public void reset() {
      *
      * @return the string
      */
+    /**
+     * This produces a LaTeX-Expression representing the entire protocol.
+     *
+     * @return the string
+     */
     public String protocol2LaTeX() {
-        return step2LaTeX(0);
+        String retString = "";
+        for (int i = 0; i < protocol.size(); i++) {
+            retString +=  this.step2LaTeX(i) + "\n \n";
+        }
+        return retString;
     }
 
     /**

src/main/java/de/moritzf/sorting/logic/sorting/QuickSort.java

@@ -4,23 +4,23 @@
 
 /**
  * @author Moritz Floeter
- *         <p>
- *         The class QuickSort.
- *         This class represents the implementation of the algorithm quicksort.
- *         <p>
- *         --------------------------------------------------------------------
- *         This program is free software: you can redistribute it and/or modify
- *         it under the terms of the GNU General Public License as published by
- *         the Free Software Foundation, either version 3 of the License, or
- *         (at your option) any later version.
- *         <p>
- *         This program is distributed in the hope that it will be useful,
- *         but WITHOUT ANY WARRANTY; without even the implied warranty of
- *         MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- *         GNU General Public License for more details.
- *         <p>
- *         You should have received a copy of the GNU General Public License
- *         along with this program.  If not, see <http://www.gnu.org/licenses/>.
+ * <p>
+ * The class QuickSort.
+ * This class represents the implementation of the algorithm quicksort.
+ * <p>
+ * --------------------------------------------------------------------
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ * <p>
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ * <p>
+ * You should have received a copy of the GNU General Public License
+ * along with this program.  If not, see <http://www.gnu.org/licenses/>.
  */
 public class QuickSort extends SortingAlgorithm {
 
@@ -144,7 +144,7 @@ public boolean doStep() {
                         int temp = oldArrayClone[leftEnd];
                         oldArrayClone[leftEnd] = oldArrayClone[rightEnd];
                         oldArrayClone[rightEnd] = temp;
-						/*
+                        /*
 						 * When the rightEnd and the leftEnd have "traded sides"
 						 * this means that all elements are on the according
 						 * side. The only thing left to do here is to swap the
@@ -281,8 +281,8 @@ private static int[] subArray(int[] original, int begin, int end) {
     public String protocol2LaTeX() {
         String retString = "";
         for (int i = 0; i < protocol.size(); i++) {
-            retString += " " + this.step2LaTeX(i)
-                    + "\n\\newline \n\\newline \n\\newline \n";
+            retString += this.step2LaTeX(i)
+                    + "\n\n";
         }
         return retString;
     }
@@ -422,5 +422,4 @@ public int getStepLimit() {
     }
 
 
-
 }

src/main/java/de/moritzf/sorting/logic/sorting/RadixSort.java

@@ -205,7 +205,7 @@ public String step2LaTeX(int stepNumber) {
     public String protocol2LaTeX() {
         String retString = "";
         for (int i = 0; i < protocol.size(); i++) {
-            retString += " " + this.step2LaTeX(i) + " \n\\newline \n";
+            retString += " " + this.step2LaTeX(i) + " \n \n";
         }
 
         return retString;

src/main/java/de/moritzf/sorting/logic/sorting/SelectionSort.java

@@ -217,7 +217,7 @@ public void doAllSteps() {
     public String protocol2LaTeX() {
         String retString = "";
         for (int i = 0; i < protocol.size(); i++) {
-            retString += " " + this.step2LaTeX(i) + "\n\\newline \n\\newline \n";
+            retString += this.step2LaTeX(i) + "\n \n";
         }
 
         return retString;