Move sorts

Gaming32 · Feb 15, 2022 · 5ad6c80 · 5ad6c80
1 parent 4403cfc
commit 5ad6c80
Show file tree

Hide file tree

Showing 247 changed files with 1,100 additions and 1,101 deletions.
diff --git a/src/main/java/io/github/arrayv/sortdata/NewSortInstance.java b/src/main/java/io/github/arrayv/sortdata/NewSortInstance.java
@@ -6,8 +6,8 @@
 import java.lang.reflect.Constructor;
 import java.util.function.Supplier;
 
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
-import sorts.templates.Sort;
 
 public final class NewSortInstance implements Supplier<Sort> {
     private static final MethodHandles.Lookup LOOKUP = MethodHandles.publicLookup();

diff --git a/src/main/java/io/github/arrayv/sortdata/SortInfo.java b/src/main/java/io/github/arrayv/sortdata/SortInfo.java
@@ -4,8 +4,8 @@
 import java.util.HashSet;
 import java.util.function.Supplier;
 
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
-import sorts.templates.Sort;
 
 public final class SortInfo {
     private final int id;

diff --git a/...orts/concurrent/BitonicSortIterative.java → ...orts/concurrent/BitonicSortIterative.java b/...orts/concurrent/BitonicSortIterative.java → ...orts/concurrent/BitonicSortIterative.java
@@ -1,7 +1,7 @@
-package sorts.concurrent;
+package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
-import sorts.templates.Sort;
 
 /*
  * This version of Bitonic Sort was taken from here, written by Nikos Pitsianis:

diff --git a/...sorts/concurrent/BitonicSortParallel.java → ...sorts/concurrent/BitonicSortParallel.java b/...sorts/concurrent/BitonicSortParallel.java → ...sorts/concurrent/BitonicSortParallel.java
@@ -1,7 +1,7 @@
-package sorts.concurrent;
+package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
-import sorts.templates.Sort;
 
 public final class BitonicSortParallel extends Sort {
     private int[] arr;

diff --git a/...orts/concurrent/BitonicSortRecursive.java → ...orts/concurrent/BitonicSortRecursive.java b/...orts/concurrent/BitonicSortRecursive.java → ...orts/concurrent/BitonicSortRecursive.java
@@ -1,7 +1,7 @@
-package sorts.concurrent;
+package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
-import sorts.templates.Sort;
 
 /*
  * This version of Bitonic Sort was taken from here, written by H.W. Lang:

diff --git a/...s/concurrent/BoseNelsonSortIterative.java → ...s/concurrent/BoseNelsonSortIterative.java b/...s/concurrent/BoseNelsonSortIterative.java → ...s/concurrent/BoseNelsonSortIterative.java
@@ -1,7 +1,7 @@
-package sorts.concurrent;
+package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
-import sorts.templates.Sort;
 
 public final class BoseNelsonSortIterative extends Sort {
     public BoseNelsonSortIterative(ArrayVisualizer arrayVisualizer) {

diff --git a/...ts/concurrent/BoseNelsonSortParallel.java → ...ts/concurrent/BoseNelsonSortParallel.java b/...ts/concurrent/BoseNelsonSortParallel.java → ...ts/concurrent/BoseNelsonSortParallel.java
@@ -1,6 +1,6 @@
-package sorts.concurrent;
+package io.github.arrayv.sorts.concurrent;
 
-import sorts.templates.Sort;
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
 
 public final class BoseNelsonSortParallel extends Sort {

diff --git a/...s/concurrent/BoseNelsonSortRecursive.java → ...s/concurrent/BoseNelsonSortRecursive.java b/...s/concurrent/BoseNelsonSortRecursive.java → ...s/concurrent/BoseNelsonSortRecursive.java
@@ -1,6 +1,6 @@
-package sorts.concurrent;
+package io.github.arrayv.sorts.concurrent;
 
-import sorts.templates.Sort;
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
 
 public final class BoseNelsonSortRecursive extends Sort {

diff --git a/...ain/java/sorts/concurrent/CreaseSort.java → ...b/arrayv/sorts/concurrent/CreaseSort.java b/...ain/java/sorts/concurrent/CreaseSort.java → ...b/arrayv/sorts/concurrent/CreaseSort.java
@@ -1,6 +1,6 @@
-package sorts.concurrent;
+package io.github.arrayv.sorts.concurrent;
 
-import sorts.templates.Sort;
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
 
 /*

diff --git a/...orts/concurrent/DiamondSortIterative.java → ...orts/concurrent/DiamondSortIterative.java b/...orts/concurrent/DiamondSortIterative.java → ...orts/concurrent/DiamondSortIterative.java
@@ -1,7 +1,7 @@
-package sorts.concurrent;
+package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
-import sorts.templates.Sort;
 
 /*
  *

diff --git a/...orts/concurrent/DiamondSortRecursive.java → ...orts/concurrent/DiamondSortRecursive.java b/...orts/concurrent/DiamondSortRecursive.java → ...orts/concurrent/DiamondSortRecursive.java
@@ -1,7 +1,7 @@
-package sorts.concurrent;
+package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
-import sorts.templates.Sort;
 
 public final class DiamondSortRecursive extends Sort {
     private final double DELAY = 0.05;

diff --git a/src/main/java/sorts/concurrent/FoldSort.java → ...hub/arrayv/sorts/concurrent/FoldSort.java b/src/main/java/sorts/concurrent/FoldSort.java → ...hub/arrayv/sorts/concurrent/FoldSort.java
@@ -1,6 +1,6 @@
-package sorts.concurrent;
+package io.github.arrayv.sorts.concurrent;
 
-import sorts.templates.Sort;
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
 
 /*

diff --git a/...ain/java/sorts/concurrent/MatrixSort.java → ...b/arrayv/sorts/concurrent/MatrixSort.java b/...ain/java/sorts/concurrent/MatrixSort.java → ...b/arrayv/sorts/concurrent/MatrixSort.java
@@ -1,7 +1,7 @@
-package sorts.concurrent;
+package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
-import sorts.templates.Sort;
 
 /*
 Idea made by Control#2866 in The Studio Discord Server (https://discord.com/invite/2xGkKC2)

diff --git a/...oncurrent/MergeExchangeSortIterative.java → ...oncurrent/MergeExchangeSortIterative.java b/...oncurrent/MergeExchangeSortIterative.java → ...oncurrent/MergeExchangeSortIterative.java
@@ -1,6 +1,6 @@
-package sorts.concurrent;
+package io.github.arrayv.sorts.concurrent;
 
-import sorts.templates.Sort;
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
 
 public final class MergeExchangeSortIterative extends Sort {

diff --git a/...concurrent/OddEvenMergeSortIterative.java → ...concurrent/OddEvenMergeSortIterative.java b/...concurrent/OddEvenMergeSortIterative.java → ...concurrent/OddEvenMergeSortIterative.java
@@ -1,7 +1,7 @@
-package sorts.concurrent;
+package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
-import sorts.templates.Sort;
 
 /*
  * This version of Odd-Even Merge Sort was taken from here, written by wkpark on StackOverflow:

diff --git a/.../concurrent/OddEvenMergeSortParallel.java → .../concurrent/OddEvenMergeSortParallel.java b/.../concurrent/OddEvenMergeSortParallel.java → .../concurrent/OddEvenMergeSortParallel.java
@@ -1,6 +1,6 @@
-package sorts.concurrent;
+package io.github.arrayv.sorts.concurrent;
 
-import sorts.templates.Sort;
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
 
 /*

diff --git a/...concurrent/OddEvenMergeSortRecursive.java → ...concurrent/OddEvenMergeSortRecursive.java b/...concurrent/OddEvenMergeSortRecursive.java → ...concurrent/OddEvenMergeSortRecursive.java
@@ -1,7 +1,7 @@
-package sorts.concurrent;
+package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
-import sorts.templates.Sort;
 
 /*
  * This version of Odd-Even Merge Sort was taken from here, written by H.W. Lang:

diff --git a/...oncurrent/PairwiseMergeSortIterative.java → ...oncurrent/PairwiseMergeSortIterative.java b/...oncurrent/PairwiseMergeSortIterative.java → ...oncurrent/PairwiseMergeSortIterative.java
@@ -1,7 +1,7 @@
-package sorts.concurrent;
+package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
-import sorts.templates.Sort;
 
 /*
  *

diff --git a/...oncurrent/PairwiseMergeSortRecursive.java → ...oncurrent/PairwiseMergeSortRecursive.java b/...oncurrent/PairwiseMergeSortRecursive.java → ...oncurrent/PairwiseMergeSortRecursive.java
@@ -1,7 +1,7 @@
-package sorts.concurrent;
+package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
-import sorts.templates.Sort;
 
 /*
  *

diff --git a/...rts/concurrent/PairwiseSortIterative.java → ...rts/concurrent/PairwiseSortIterative.java b/...rts/concurrent/PairwiseSortIterative.java → ...rts/concurrent/PairwiseSortIterative.java
@@ -1,7 +1,7 @@
-package sorts.concurrent;
+package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
-import sorts.templates.Sort;
 
 /*
  *

diff --git a/...rts/concurrent/PairwiseSortRecursive.java → ...rts/concurrent/PairwiseSortRecursive.java b/...rts/concurrent/PairwiseSortRecursive.java → ...rts/concurrent/PairwiseSortRecursive.java
@@ -1,7 +1,7 @@
-package sorts.concurrent;
+package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
-import sorts.templates.Sort;
 
 /*
  *

diff --git a/.../sorts/concurrent/WeaveSortIterative.java → .../sorts/concurrent/WeaveSortIterative.java b/.../sorts/concurrent/WeaveSortIterative.java → .../sorts/concurrent/WeaveSortIterative.java
@@ -1,6 +1,6 @@
-package sorts.concurrent;
+package io.github.arrayv.sorts.concurrent;
 
-import sorts.templates.Sort;
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
 
 /*

diff --git a/...a/sorts/concurrent/WeaveSortParallel.java → ...v/sorts/concurrent/WeaveSortParallel.java b/...a/sorts/concurrent/WeaveSortParallel.java → ...v/sorts/concurrent/WeaveSortParallel.java
@@ -1,7 +1,7 @@
-package sorts.concurrent;
+package io.github.arrayv.sorts.concurrent;
 
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
-import sorts.templates.Sort;
 
 public final class WeaveSortParallel extends Sort {
     private int[] arr;

diff --git a/.../sorts/concurrent/WeaveSortRecursive.java → .../sorts/concurrent/WeaveSortRecursive.java b/.../sorts/concurrent/WeaveSortRecursive.java → .../sorts/concurrent/WeaveSortRecursive.java
@@ -1,6 +1,6 @@
-package sorts.concurrent;
+package io.github.arrayv.sorts.concurrent;
 
-import sorts.templates.Sort;
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
 
 /*

diff --git a/...va/sorts/distribute/AmericanFlagSort.java → ...yv/sorts/distribute/AmericanFlagSort.java b/...va/sorts/distribute/AmericanFlagSort.java → ...yv/sorts/distribute/AmericanFlagSort.java
@@ -1,7 +1,7 @@
-package sorts.distribute;
+package io.github.arrayv.sorts.distribute;
 
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
-import sorts.templates.Sort;
 
 /*
  *

diff --git a/.../distribute/BinaryQuickSortIterative.java → .../distribute/BinaryQuickSortIterative.java b/.../distribute/BinaryQuickSortIterative.java → .../distribute/BinaryQuickSortIterative.java
@@ -1,7 +1,7 @@
-package sorts.distribute;
+package io.github.arrayv.sorts.distribute;
 
+import io.github.arrayv.sorts.templates.BinaryQuickSorting;
 import main.ArrayVisualizer;
-import sorts.templates.BinaryQuickSorting;
 
 /**
  * Binary MSD Radix Sort / Binary Quicksort.

diff --git a/.../distribute/BinaryQuickSortRecursive.java → .../distribute/BinaryQuickSortRecursive.java b/.../distribute/BinaryQuickSortRecursive.java → .../distribute/BinaryQuickSortRecursive.java
@@ -1,7 +1,7 @@
-package sorts.distribute;
+package io.github.arrayv.sorts.distribute;
 
+import io.github.arrayv.sorts.templates.BinaryQuickSorting;
 import main.ArrayVisualizer;
-import sorts.templates.BinaryQuickSorting;
 
 /**
  * Binary MSD Radix Sort / Binary Quicksort.

diff --git a/...n/java/sorts/distribute/BogoBogoSort.java → ...arrayv/sorts/distribute/BogoBogoSort.java b/...n/java/sorts/distribute/BogoBogoSort.java → ...arrayv/sorts/distribute/BogoBogoSort.java
@@ -1,7 +1,7 @@
-package sorts.distribute;
+package io.github.arrayv.sorts.distribute;
 
+import io.github.arrayv.sorts.templates.BogoSorting;
 import main.ArrayVisualizer;
-import sorts.templates.BogoSorting;
 
 /*
  *

diff --git a/src/main/java/sorts/distribute/BogoSort.java → ...hub/arrayv/sorts/distribute/BogoSort.java b/src/main/java/sorts/distribute/BogoSort.java → ...hub/arrayv/sorts/distribute/BogoSort.java
@@ -1,7 +1,7 @@
-package sorts.distribute;
+package io.github.arrayv.sorts.distribute;
 
+import io.github.arrayv.sorts.templates.BogoSorting;
 import main.ArrayVisualizer;
-import sorts.templates.BogoSorting;
 
 /*
  *

diff --git a/src/main/java/sorts/distribute/BozoSort.java → ...hub/arrayv/sorts/distribute/BozoSort.java b/src/main/java/sorts/distribute/BozoSort.java → ...hub/arrayv/sorts/distribute/BozoSort.java
@@ -1,7 +1,7 @@
-package sorts.distribute;
+package io.github.arrayv.sorts.distribute;
 
+import io.github.arrayv.sorts.templates.BogoSorting;
 import main.ArrayVisualizer;
-import sorts.templates.BogoSorting;
 
 /**
  * Bozosort randomly swaps any two elements until the array is sorted.

diff --git a/.../sorts/distribute/ClassicGravitySort.java → .../sorts/distribute/ClassicGravitySort.java b/.../sorts/distribute/ClassicGravitySort.java → .../sorts/distribute/ClassicGravitySort.java
@@ -1,7 +1,7 @@
-package sorts.distribute;
+package io.github.arrayv.sorts.distribute;
 
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
-import sorts.templates.Sort;
 
 /*
  *

diff --git a/...va/sorts/distribute/CocktailBogoSort.java → ...yv/sorts/distribute/CocktailBogoSort.java b/...va/sorts/distribute/CocktailBogoSort.java → ...yv/sorts/distribute/CocktailBogoSort.java
@@ -1,7 +1,7 @@
-package sorts.distribute;
+package io.github.arrayv.sorts.distribute;
 
+import io.github.arrayv.sorts.templates.BogoSorting;
 import main.ArrayVisualizer;
-import sorts.templates.BogoSorting;
 
 /**
  * Cocktail Bogosort is a bidirectional variation of Less Bogosort.

diff --git a/...n/java/sorts/distribute/CountingSort.java → ...arrayv/sorts/distribute/CountingSort.java b/...n/java/sorts/distribute/CountingSort.java → ...arrayv/sorts/distribute/CountingSort.java
@@ -1,7 +1,7 @@
-package sorts.distribute;
+package io.github.arrayv.sorts.distribute;
 
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
-import sorts.templates.Sort;
 
 /*
  *

diff --git a/...rts/distribute/DeterministicBogoSort.java → ...rts/distribute/DeterministicBogoSort.java b/...rts/distribute/DeterministicBogoSort.java → ...rts/distribute/DeterministicBogoSort.java
@@ -1,7 +1,7 @@
-package sorts.distribute;
+package io.github.arrayv.sorts.distribute;
 
+import io.github.arrayv.sorts.templates.BogoSorting;
 import main.ArrayVisualizer;
-import sorts.templates.BogoSorting;
 
 /* MIT License
 Copyright (c) 2020 Walker Gray

diff --git a/...main/java/sorts/distribute/FlashSort.java → ...ub/arrayv/sorts/distribute/FlashSort.java b/...main/java/sorts/distribute/FlashSort.java → ...ub/arrayv/sorts/distribute/FlashSort.java
@@ -1,10 +1,10 @@
-package sorts.distribute;
+package io.github.arrayv.sorts.distribute;
 
 import java.util.Arrays;
 
+import io.github.arrayv.sorts.insert.InsertionSort;
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
-import sorts.insert.InsertionSort;
-import sorts.templates.Sort;
 
 public final class FlashSort extends Sort {
     public FlashSort(ArrayVisualizer arrayVisualizer) {

diff --git a/...in/java/sorts/distribute/GravitySort.java → .../arrayv/sorts/distribute/GravitySort.java b/...in/java/sorts/distribute/GravitySort.java → .../arrayv/sorts/distribute/GravitySort.java
@@ -1,7 +1,7 @@
-package sorts.distribute;
+package io.github.arrayv.sorts.distribute;
 
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
-import sorts.templates.Sort;
 
 /*
  *

diff --git a/...main/java/sorts/distribute/GuessSort.java → ...ub/arrayv/sorts/distribute/GuessSort.java b/...main/java/sorts/distribute/GuessSort.java → ...ub/arrayv/sorts/distribute/GuessSort.java
@@ -1,7 +1,7 @@
-package sorts.distribute;
+package io.github.arrayv.sorts.distribute;
 
+import io.github.arrayv.sorts.templates.BogoSorting;
 import main.ArrayVisualizer;
-import sorts.templates.BogoSorting;
 
 public final class GuessSort extends BogoSorting {
     public GuessSort(ArrayVisualizer arrayVisualizer) {

diff --git a/...sorts/distribute/InPlaceLSDRadixSort.java → ...sorts/distribute/InPlaceLSDRadixSort.java b/...sorts/distribute/InPlaceLSDRadixSort.java → ...sorts/distribute/InPlaceLSDRadixSort.java
@@ -1,7 +1,7 @@
-package sorts.distribute;
+package io.github.arrayv.sorts.distribute;
 
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
-import sorts.templates.Sort;
 
 /*
  *

diff --git a/...main/java/sorts/distribute/IndexSort.java → ...ub/arrayv/sorts/distribute/IndexSort.java b/...main/java/sorts/distribute/IndexSort.java → ...ub/arrayv/sorts/distribute/IndexSort.java
@@ -1,7 +1,7 @@
-package sorts.distribute;
+package io.github.arrayv.sorts.distribute;
 
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
-import sorts.templates.Sort;
 
 /*
  *

diff --git a/...n/java/sorts/distribute/LSDRadixSort.java → ...arrayv/sorts/distribute/LSDRadixSort.java b/...n/java/sorts/distribute/LSDRadixSort.java → ...arrayv/sorts/distribute/LSDRadixSort.java
@@ -1,9 +1,9 @@
-package sorts.distribute;
+package io.github.arrayv.sorts.distribute;
 
 import java.util.ArrayList;
 
+import io.github.arrayv.sorts.templates.Sort;
 import main.ArrayVisualizer;
-import sorts.templates.Sort;
 
 /*
  *