start new Heapsort-Implementation

Author: moritzfl

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

@@ -0,0 +1,28 @@
+package de.moritzf.sorting.logic.sorting;
+
+import java.util.ArrayList;
+import java.util.StringJoiner;
+
+public class HeapSortNodeValue {
+
+ private ArrayList<Integer> numbers = new ArrayList<>();
+
+ public HeapSortNodeValue(int initialNumbers) {
+ numbers.add(initialNumbers);
+ }
+
+ public int getNumber() {
+ return numbers.get(numbers.size() - 1);
+ }
+
+ public void setNumber(int number) {
+ this.numbers.add(number);
+ }
+
+ @Override
+ public String toString() {
+ return new StringJoiner(", ", this.getClass().getSimpleName() + "[", "]")
+ .add("numbers = " + numbers)
+ .toString();
+ }
+}

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

@@ -0,0 +1,45 @@
+package de.moritzf.sorting.logic.sorting;
+
+public class NewHeapSort extends SortingAlgorithm{
+
+
+ @Override
+ public void doAllSteps() {
+
+ }
+
+ @Override
+ public boolean doStep() {
+ return false;
+ }
+
+ @Override
+ public int getInputSize() {
+ return 0;
+ }
+
+ @Override
+ public void reset() {
+
+ }
+
+ @Override
+ public String protocol2LaTeX() {
+ return null;
+ }
+
+ @Override
+ public boolean undoStep() {
+ return false;
+ }
+
+ @Override
+ public String getName() {
+ return "Heapsort";
+ }
+
+ @Override
+ public int getStepLimit() {
+ return 0;
+ }
+}

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

@@ -0,0 +1,7 @@
+package de.moritzf.sorting.logic.sorting;
+
+public class NewHeapStep {
+
+ TreeNode<HeapSortNodeValue> currentNode;
+
+}

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

@@ -0,0 +1,85 @@
+package de.moritzf.sorting.logic.sorting;
+
+
+import java.util.*;
+
+public class TreeNode<T> {
+ private T value;
+ private TreeNode<T> parent;
+ private List<TreeNode<T>> children = new ArrayList<>();
+
+ public TreeNode(T value) {
+ this.value = value;
+ }
+
+ public T getValue() {
+ return this.value;
+ }
+
+ public void addChild(TreeNode<T> child) {
+ this.children.add(child);
+ child.parent = this;
+ }
+
+ public void removeChild(TreeNode<T> child) {
+ this.children.remove(child);
+ child.setParent(null);
+
+ }
+
+ public void setParent(TreeNode<T> parent) {
+ if (this.parent != null) {
+ this.parent.children.remove(this);
+ }
+ if (parent != null) {
+ parent.addChild(this);
+ }
+ this.parent = parent;
+ }
+
+ public String toString() {
+ return this.value.toString();
+ }
+
+ public TreeNode<T> getNode(int index) {
+ Queue<TreeNode<T>> queue = new LinkedList<>();
+ queue.add(this.getRootNode());
+ int breathSearchNiv = 1;
+ while (queue.poll() != null && breathSearchNiv != index) {
+ this.getChildren().forEach(child -> queue.add(child));
+ queue.remove();
+ breathSearchNiv++;
+ }
+ return queue.poll();
+ }
+
+
+ private int getNodeNumber() {
+ Queue<TreeNode<T>> queue = new LinkedList<>();
+ queue.add(this.getRootNode());
+ int breathSearchNiv = 1;
+ while (queue.poll() != null && !this.equals(queue.poll())) {
+ this.getChildren().forEach(child -> queue.add(child));
+ queue.remove();
+ breathSearchNiv++;
+ }
+ return breathSearchNiv;
+
+ }
+
+ public List<TreeNode<T>> getChildren() {
+ return new ArrayList<>(this.children);
+ }
+
+ public TreeNode<T> getRootNode() {
+ TreeNode<T> parent = this;
+
+ while (parent.parent != null) {
+ parent = parent.parent;
+ }
+
+ return parent;
+ }
+
+
+}