diff --git a/dist/arrayVisualizer.jar b/dist/arrayVisualizer.jar
index 8833042c..755338c5 100644
Binary files a/dist/arrayVisualizer.jar and b/dist/arrayVisualizer.jar differ
diff --git a/dist/sorts/hybrid/OptimizedWeaveMergeSort.java b/dist/sorts/hybrid/OptimizedWeaveMergeSort.java
deleted file mode 100644
index 25e796b0..00000000
--- a/dist/sorts/hybrid/OptimizedWeaveMergeSort.java
+++ /dev/null
@@ -1,176 +0,0 @@
-package sorts.hybrid;
-
-import main.ArrayVisualizer;
-import sorts.templates.Sort;
-
-/*
- * 
-MIT License
-
-Copyright (c) 2020 aphitorite
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
- *
- */
-
-final public class OptimizedWeaveMergeSort extends Sort {
-    public OptimizedWeaveMergeSort(ArrayVisualizer arrayVisualizer) {
-        super(arrayVisualizer);
-        
-        this.setSortListName("Opti. Weave Merge");
-        this.setRunAllSortsName("Optimized Weave Merge Sort");
-        this.setRunSortName("Optimized Weave Mergesort");
-        this.setCategory("Hybrid Sorts");
-        this.setComparisonBased(true);
-        this.setBucketSort(false);
-        this.setRadixSort(false);
-        this.setUnreasonablySlow(false);
-        this.setUnreasonableLimit(0);
-        this.setBogoSort(false);
-    }
-	
-	private void insertTo(int[] array, int a, int b) {
-		int temp = array[a];
-		while(a > b) Writes.write(array, a, array[(a--)-1], 0.25, true, false);
-		Writes.write(array, b, temp, 0.25, true, false);
-	}
-	
-	private void multiSwap(int[] array, int a, int b, int len) {
-		for(int i = 0; i < len; i++)
-			Writes.swap(array, a+i, b+i, 1, true, false);
-	}
-	
-    private void rotate(int[] array, int a, int m, int b) {
-        int l = m-a, r = b-m;
-		
-        while(l > 0 && r > 0) {
-			if(r < l) {
-				this.multiSwap(array, m-r, m, r);
-				b -= r;
-				m -= r;
-				l -= r;
-            }
-            else {
-				this.multiSwap(array, a, m, l);
-				a += l;
-				m += l;
-				r -= l;
-            }
-        }
-    }
-    
-	//special thanks to @Piotr Grochowski
-	//pow of 2 only
-	private void bitReversal(int[] array, int a, int b) {
-		int len = b-a,
-			log = (int)(Math.log(len)/Math.log(2));
-		
-		for(int i = 1; i < len-1; i++) {
-			int j = 0, k = i;
-			
-			for(int l = log; l > 0; l--){
-				j *= 2;
-				j += k%2;
-				k /= 2;
-			}
-			
-			if(j > i) Writes.swap(array, a+i, a+j, 1, true, false);
-		}
-	}
-	
-	private void weaveInsert(int[] array, int a, int b, boolean right) {
-		int i = a, j = i+1;
-		
-		while(j < b) {
-			Highlights.markArray(2, i);
-			Highlights.markArray(3, j);
-			while(i < j && Reads.compareIndices(array, i, j, 0, false) < (right ? 1 : 0)) i++;
-			
-			if(i == j) {
-				right = !right;
-				j++;
-			}
-			else {
-				this.insertTo(array, j, i++);
-				j += 2;
-			}
-		}
-		Highlights.clearMark(3);
-	}
-	
-	//000111 -> 010101 T
-	//00011  -> 01010  T
-	//00111  -> 10101  F
-    private void weaveMerge(int[] array, int a, int m, int b) {
-		if(b-a < 2) return;
-		
-		int a1 = a, b1 = b;
-		boolean right = true;
-		
-		if((b-a)%2 == 1) {
-			if(m-a < b-m) {
-				a1--;
-				right = false;
-			}
-			else b1++;
-		}
-		
-		for(int e = b1, f; e-a1 > 2; e = f) {
-			m = (a1+e)/2;
-			int p = 1 << (int)(Math.log(m-a1)/Math.log(2));
-			
-			this.rotate(array, m-p, m, e-p);
-			m = e-p;
-			f = m-p;
-			
-			this.bitReversal(array, f, m);
-			this.bitReversal(array, m, e);
-			this.bitReversal(array, f, e);
-		}
-    	Highlights.clearMark(2);
-    	this.weaveInsert(array, a, b, right);
-    }
-
-    @Override
-    public void runSort(int[] array, int currentLength, int bucketCount) {
-        int n = currentLength, d = 1 << (int)(Math.log(n-1)/Math.log(2) + 1);
-        
-        while(d > 1) {
-            int i = 0, dec = 0;
-            
-            while(i < n) {
-                int j = i;
-                dec += n;
-                while(dec >= d) {
-                    dec -= d;
-                    j++;
-                }
-                int k = j;
-                dec += n;
-                while(dec >= d) {
-                    dec -= d;
-                    k++;
-                }
-                this.weaveMerge(array, i, j, k);
-                i = k;
-            }
-            d /= 2;
-        }
-    }
-}
\ No newline at end of file