diff --git a/index/src/pages/Algorithms/algorithms.js b/index/src/pages/Algorithms/algorithms.js
deleted file mode 100644
index 9730e1f..0000000
--- a/index/src/pages/Algorithms/algorithms.js
+++ /dev/null
@@ -1,555 +0,0 @@
-/*********** VISUALIZATION HELPER FUNCTIONS ***********/
-var display = document.getElementById("arrtable");
-var comments =  document.getElementById("comments");
-var comments2 = document.getElementById("comments2");
-
-function printArrayVisual(arr) {
-    let table = document.createElement("table");
-    let tablerow = document.createElement("tr");
-
-    display.appendChild(table).appendChild(tablerow);
-    for(let i=0; i<arr.length; i++) {
-        let tablecell = document.createElement("td");
-        tablecell.innerHTML = arr[i];
-        tablerow.appendChild(tablecell);
-    }
-}
-
-async function tablify(arr, swap1 = null, swap2 = null, upto = null) {
-    removeAllChildren("arrtable");
-    let table = document.createElement("table");
-    let tablerow = document.createElement("tr");
-
-    display.appendChild(table).appendChild(tablerow);
-    for(let i=0; i<arr.length; i++) {
-        let tablecell = document.createElement("td");
-        tablecell.innerHTML = arr[i];
-        tablerow.appendChild(tablecell);
-
-        if( upto != null && i <= upto) tablecell.classList.add("corange");
-        if(i == swap1) {
-            tablecell.classList.remove("corange");
-            tablecell.classList.add("cred");
-        }
-        if(i == swap2) {
-            tablecell.classList.remove("corange");
-            tablecell.classList.add("cgreen");
-        }
-
-    }
-
-    await sleep(2000);
-}
-
-
-async function noSwapTablify(arr, check1 = null, check2 = null, upto = null) {
-    removeAllChildren("arrtable");
-    let table = document.createElement("table");
-    let tablerow = document.createElement("tr");
-
-    display.appendChild(table).appendChild(tablerow);
-    for(let i=0; i<arr.length; i++) {
-        let tablecell = document.createElement("td");
-        tablecell.innerHTML = arr[i];
-        tablerow.appendChild(tablecell);
-
-        if(upto != null && i <= upto) tablecell.classList.add("corange");
-        if(i == check1 || i == check2) {
-            tablecell.classList.add("cblue");
-        }
-    }
-
-    await sleep(1000);
-}
-
-async function tablifyQuickSort(arr, swap1 = null, swap2 = null, left = null, right = null) {
-    removeAllChildren("arrtable");
-    let table = document.createElement("table");
-    let tablerow = document.createElement("tr");
-
-    display.appendChild(table).appendChild(tablerow);
-    for(let i=0; i<arr.length; i++) {
-        let tablecell = document.createElement("td");
-        tablecell.innerHTML = arr[i];
-        tablerow.appendChild(tablecell);
-
-        tablecell.classList = "";
-        if(i == left) tablecell.classList.add("bleft");
-        if(i == right) tablecell.classList.add("bright");
-        if(i > left && i < right) tablecell.classList.add("bbold");
-        if(i >= left && i <= swap1 && left != null) tablecell.classList.add("corange");
-
-    }
-
-    await sleep(2000);
-}
-
-async function visualizeHeapify(arr, sorted, swap1 = -1, swap2 = -1, isEnd = false) {
-
-    let sleepTime = (swap1 < 0 && swap2 < 0) ? 1000 : 2500;
-    display.style.textAlign = "center";
-
-    let tree = document.createElement("div");
-    tree.style.padding = "50px";
-
-    let depth = 1;
-    let spacer = 16;
-    let spacerBetween = 256;
-    let nextBreak = Math.pow(2, depth);
-
-
-    for(let i=0; i<arr.length; i++) {
-
-        let br = document.createElement("br");
-
-        let leftArm = document.createElement("div");
-        let rightArm = document.createElement("div");
-        leftArm.innerHTML = "/";
-        rightArm.innerHTML = "\\" + "&nbsp;";
-
-        leftArm.style.textAlign = "left";
-        rightArm.style.textAlign = "right";
-
-        var node = document.createElement("div");
-        var nodeValue = document.createElement("div");
-        node.style.display = "inline-block";
-        
-        if(i == 0) {
-            nodeValue.innerHTML = arr[i] + "";
-            node.appendChild(nodeValue);
-            node.style.textAlign = "center";
-            tree.appendChild(node);
-            tree.appendChild(br);
-        } else if(i%2 == 0) {
-            node.appendChild(rightArm);
-            node.style.textAlign = "right";
-            nodeValue.style.textAlign = "right";
-            node.style.paddingRight = spacerBetween + "px";
-            node.style.color = "#2962ff";
-            nodeValue.innerHTML = arr[i] + "&nbsp;";
-            nodeValue = addSpace(nodeValue, spacer, false);
-            node.appendChild(nodeValue);
-            node = addSpace(node, spacer, false);
-            tree.appendChild(node);
-        } else {
-            node.appendChild(leftArm);
-            node.style.textAlign = "left";
-            nodeValue.style.textAlign = "left";
-            node.style.color = "#ffc629";
-            nodeValue.innerHTML = arr[i] + "&nbsp;";
-            nodeValue = addSpace(nodeValue, spacer, true);
-            node.appendChild(nodeValue);
-            node = addSpace(node, spacer, false);
-            tree.appendChild(node);
-        }
-
-        if (i == swap1) {
-            node.style.color = "red";
-        } else if (i == swap2) {
-            node.style.color = "green";
-        }
-        
-        if(i > sorted-1 && sorted != 0) {
-            node.style.fontWeight = "bold";
-            node.style.color = "black";
-        }
-
-        if(i == nextBreak) {
-            node.style.paddingRight = "0px";
-            tree.appendChild(br);
-            ++depth;
-            spacer /= 2;
-            spacerBetween /= 2;
-            nextBreak = nextBreak + Math.pow(2, depth);
-        }
-
-    }
-    display.appendChild(tree);
-    
-    await sleep(sleepTime);
-    if(!isEnd) removeAllChildren("arrtable");
-}
-
-function addSpace(node, spaces, after) {
-
-    let space = "";
-    for(let i=0; i<spaces; i++) {
-        space = space + "&nbsp;";
-    }
-
-    (after) ? node.innerHTML = node.innerHTML + space : node.innerHTML = space + node.innerHTML;
-    return node;
-
-}
-
-function removeAllChildren(node) {
-    let parent = document.getElementById(node);
-    while(parent.lastChild) {
-        parent.removeChild(parent.lastChild);
-    }
-}
-
-function sleep(ms) {
-    return new Promise(resolve => setTimeout(resolve, ms));
-}
-
-function trimArray(arr, start, end) {
-
-    let arrcopy = new Array((end+1)-start);
-    let j = 0;
-    
-    for(let i=start; i<=end; i++) {
-        arrcopy[j] = arr[i];
-        j++;
-    }
-    return arrcopy;
-}
-
-
-/*********** SORT ALGORITHMS ***********/
-
-//In-place sorting algorithms
-
-//1. Bubble Sort
-async function bubbleSort(arr) {
-
-    while(true) {
-        let swaps = 0;
-
-        for(let i=0; i<arr.length-1; i++) {
-            await noSwapTablify(arr, i, i+1);
-            if(arr[i+1] < arr[i]) {
-                await tablify(arr, i, i+1);
-                let swap = arr[i];
-                arr[i] = arr[i+1];
-                arr[i+1] = swap;
-                ++swaps;
-                await noSwapTablify(arr, i, i+1);
-            }
-        }
-        if(swaps == 0) break;
-    }
-    tablify(arr);
-    return arr;
-}
-
-
-//2. Selection Sort
-async function selectionSort(arr) {
-
-    for(let i=0; i<arr.length; i++) {
-        let min = i;
-
-        for(let j=i+1; j<arr.length; j++) {
-            if(arr[j] < arr[min]) {
-                min = j;
-            }
-        }
-        min != i ? await tablify(arr, -1, min, i-1) : await tablify(arr, -1, -1, i-1);
-        let swap = arr[min];
-        arr[min] = arr[i];
-        arr[i] = swap;
-        tablify(arr, -1, -1, i);
-
-    }
-    tablify(arr, -1, -1, arr.length);
-    return arr;
-}
-
-//3. Insertion Sort
-async function insertionSort(arr) {
-
-    for(let i=1; i<arr.length; i++) {
-        let position = arr[i];
-        let j = i-1;
-
-        removeAllChildren("comments");
-        let loops = 0;
-        let inserting = document.createElement("span");
-        inserting.innerHTML = "Inserting " + arr[j+1] + " into position...";
-        comments.appendChild(inserting);
-
-        while(j>=0 && arr[j] > position) {
-            await tablify(arr, -1, j+1, i);
-            let swap = arr[j];
-            arr[j] = arr[j+1];
-            arr[j+1] = swap;
-            await tablify(arr, -1, j, i);
-            j = j-1;
-            loops++;
-        }
-        arr[j+1] = position;
-        if(loops == 0) {
-            let msg = document.createElement("p");
-            msg.innerHTML = "&emsp;&emsp; " + arr[i] + " already in place";
-            display.appendChild(msg);
-        }
-
-    }
-    removeAllChildren("comments");
-    tablify(arr, -1, -1, arr.length);
-    return arr;
-}
-
-
-//4. Shell Sort
-function shellSort(arr) {
-    //var start = performance.now();
-
-    let gaps = [5, 3, 1];
-
-    gaps.forEach(gap => {
-        for(let position=0; position < gap; position++) {
-            for(let i=position; i < arr.length; i+=gap) {
-                let swap = arr[i];
-                let j=i;
-                for(j; j >= gap && arr[j-gap] > swap; j-=gap) {
-                    arr[j] = arr[j-gap];
-                }
-                arr[j] = swap;
-                //console.log(arr);
-            }
-        }
-    });
-    //var end = performance.now();
-    //console.log(end-start);
-    return arr;
-}
-
-
-//5. Comb Sort
-function combSort(arr) {
-
-    let gap = arr.length;
-    let isSorted = false;
-    const shrinkFactor = 1.3;
-
-    while(!isSorted) {
-        gap = Math.floor(gap/shrinkFactor);
-        if(gap <= 1) {
-            gap = 1;
-            isSorted = true;
-        }
-
-        let i=0;
-        while(i+gap < arr.length) {
-            if(arr[i] > arr[i+gap]) {
-                let swap = arr[i];
-                arr[i] = arr[i+gap];
-                arr[i+gap] = swap;
-                isSorted = false;
-                //console.log(arr);
-            }
-            i+=1;
-        }
-    }
-    return arr;
-}
-
-
-//6. Quick Sort
-//using Lomuto partition
-async function quickSort(arr, left = 0, right = arr.length-1) {
-
-    if(left >= right || left < 0) return;
-    let pivot = await partition(arr, left, right);
-
-    removeAllChildren("comments2");
-    let msg = document.createElement("span");
-    msg.innerHTML = "Sorting left arr in bold brackets. " //+ arr[left] + " to " + arr[pivot-1];
-    //comments2.appendChild(msg);
-    await quickSort(arr, left, pivot-1);
-
-    removeAllChildren("comments2");
-    let msg2 = document.createElement("p");
-    msg2.innerHTML = "Sorting right arr in bold brackets. " //+ arr[pivot+1] + " to " + arr[right];
-    //comments2.appendChild(msg2);
-    await quickSort(arr, pivot+1, right);
-
-    removeAllChildren("comments2");
-    removeAllChildren("comments");
-    await tablifyQuickSort(arr);
-    return arr;
-
-}
-
-async function partition(arr, left, right) {
-
-    let pivot = arr[right];
-    let i = left-1;
-
-    removeAllChildren("comments");
-    let pivotText = document.createElement("span");
-    let br = document.createElement("br");
-    let sorting = document.createElement("span")
-    sorting.innerHTML = "Selecting elements less than pivot...";
-    pivotText.innerHTML = "Pivot = " + pivot;
-    comments.appendChild(pivotText);
-    comments.appendChild(br);
-    comments.appendChild(sorting);
-
-    for(let j=left; j<right; j++) {
-        if(arr[j] <= pivot) {
-            await tablifyQuickSort(arr, i, j, left, right);
-            i+=1;
-            let swap = arr[i];
-            arr[i] = arr[j];
-            arr[j] = swap;
-            await tablifyQuickSort(arr, i, j, left, right);
-        }
-    }
-
-    removeAllChildren("comments");
-    let movePivot = document.createElement("span");
-    movePivot.innerHTML = "Moving pivot(" + pivot + ") to position...";
-    comments.appendChild(movePivot);
-    await tablifyQuickSort(arr, i, right, left, right);
-
-    i+=1;
-    let swap = arr[i];
-    arr[i] = arr[right];
-    arr[right] = swap;
-
-    await tablifyQuickSort(arr, i, right, left, right);
-
-    return i;
-
-}
-
-
-//7. Heap Sort
-async function heapSort(arr) {
-
-    let n = arr.length;
-
-    for(let i=Math.floor(n/2)-1; i>=0; i--) {
-        await heapify(arr, n, i);
-    }
-    let heapBuilt = document.createElement("div");
-    heapBuilt.innerHTML = "Heap built";
-    removeAllChildren("comments");
-    comments.appendChild(heapBuilt);
-
-    for(let i=n-1; i>0; i--) {
-
-        let swapRoot = document.createElement("div");
-        removeAllChildren("comments");
-        swapRoot.innerHTML = "Inserting root node to position...";
-
-        comments.appendChild(swapRoot);
-        await visualizeHeapify(arr, i+1, 0, i);
-        let swap = arr[0];
-        arr[0] = arr[i];
-        arr[i] = swap;
-        await visualizeHeapify(arr, i);
-        removeAllChildren("comments");
-
-        await heapify(arr, i, 0);
-        await visualizeHeapify(arr, i);
-    }
-
-    visualizeHeapify(arr, 1, -1, -1, true);
-    removeAllChildren("comments");
-
-    let msg = document.createElement("p");
-    msg.innerHTML = "Final array: ";
-    display.appendChild(msg);
-    printArrayVisual(arr);
-    return arr;
-}
-
-async function heapify(arr, n, i) {
-
-    let buildingHeap = document.createElement("div");
-    buildingHeap.innerHTML = "Building heap...";
-    removeAllChildren("comments");
-    comments.appendChild(buildingHeap);
-
-    let largest = i, left = 2*i+1, right = 2*i+2;
-
-    if(left < n && arr[left] > arr[largest]) {
-        largest = left;
-    }
-
-    if(right < n && arr[right] > arr[largest]) {
-        largest = right;
-    }
-
-    if(largest != i) {
-        await visualizeHeapify(arr, n, largest, i);
-
-        let swap = arr[i];
-        arr[i] = arr[largest];
-        arr[largest] = swap;
-        await visualizeHeapify(arr, n);
-        await heapify(arr, n, largest);
-    }
-
-    await visualizeHeapify(arr, n);
-
-}
-
-
-
-//Not-in place sorting
-
-//8. Merge Sort
-function mergeSort(arr, left=0, right=arr.length-1) {
-
-    if(left<right) {
-        let pivot = parseInt((left+right)/2);
-        mergeSort(arr, left, pivot);
-        mergeSort(arr, pivot+1, right);
-    
-        merge(arr, left, pivot, right);
-    }
-
-    return arr;
-}
-
-function merge(arr, left, pivot, right) {
-
-    let length1 = pivot-left+1, length2 = right-pivot;
-    let L = new Array(length1), R = new Array(length2);
-
-    for(let i=0; i<length1; i++) {
-        L[i] = arr[left+i];
-    }
-    for(let j=0; j<length2; j++) {
-        R[j] = arr[pivot+1+j];
-    }
-
-    let i=0, j=0, k=left;
-
-    while(i<length1 && j<length2) {
-        if(L[i] <= R[j]) {
-            arr[k] = L[i];
-            i++;
-        } else {
-            arr[k] = R[j];
-            j++;
-        }k++;
-    }
-
-    while(i<length1) {
-        arr[k] = L[i];
-        i++;
-        k++;
-    }
-
-    while(j<length2) {
-        arr[k] = R[j];
-        j++;
-        k++;
-    }
-
-}
-
-/*
-arr = [3,1,5,2];
-arr = [86, 15, 9, 19, 11, 18, 54, 59, 46, 20, 71, 6, 99, 89, 95, 38, 17, 74, 30, 49];
-sortArr = heapSort(arr);
-console.log(sortArr);
-*/
-
-export {bubbleSort, selectionSort, insertionSort, quickSort, heapSort, mergeSort};
\ No newline at end of file