{
props.selectAlgorithm(text);
diff --git a/src/components/SortingAlgorithms/HeapSort.js b/src/components/SortingAlgorithms/HeapSort.js
new file mode 100644
index 0000000..fc7b878
--- /dev/null
+++ b/src/components/SortingAlgorithms/HeapSort.js
@@ -0,0 +1,45 @@
+import { sleep } from "../Helper/helper";
+
+export async function HeapSort(array, setArray) {
+ let n = array.length;
+
+ // Build heap (rearrange array)
+ for (let i = Math.floor(n / 2) - 1; i >= 0; i--) {
+ await heapify(array, n, i, setArray);
+ }
+
+ for (let i = n - 1; i > 0; i--) {
+ [array[0], array[i]] = [array[i], array[0]];
+ array[i].color = "green";
+ await sleep(500);
+ setArray([...array]);
+
+ await heapify(array, i, 0, setArray);
+ }
+
+ array[0].color = "green";
+ await sleep(500);
+ setArray([...array]);
+}
+
+async function heapify(array, n, i, setArray) {
+ let largest = i; // Initialize largest as root
+ let l = 2 * i + 1; // left = 2*i + 1
+ let r = 2 * i + 2; // right = 2*i + 2
+
+ // If left child is larger than root
+ if (l < n && array[l].value > array[largest].value) largest = l;
+
+ // If right child is larger than largest so far
+ if (r < n && array[r].value > array[largest].value) largest = r;
+
+ // If largest is not root
+ if (largest !== i) {
+ [array[i], array[largest]] = [array[largest], array[i]];
+ await sleep(200);
+ setArray([...array]);
+
+ // Recursively heapify the affected sub-tree
+ await heapify(array, n, largest, setArray);
+ }
+}
\ No newline at end of file
diff --git a/src/components/SortingAlgorithms/InsertionSort.js b/src/components/SortingAlgorithms/InsertionSort.js
old mode 100644
new mode 100755
index 24df472..73247b6
--- a/src/components/SortingAlgorithms/InsertionSort.js
+++ b/src/components/SortingAlgorithms/InsertionSort.js
@@ -6,13 +6,24 @@ export async function InsertionSort(array, setArray) {
for (let i = 1; i < array.length; i++) {
temp = array[i];
j = i - 1;
- while (j >= 0 && array[j] > temp) {
+ while (j >= 0 && array[j].value > temp.value) {
array[j + 1] = array[j];
j--;
}
array[j + 1] = temp;
+ array[j + 1].color = "green";
await sleep(500);
setArray([...array]);
+
+ for (let k = 0; k <= i; k++) {
+ array[k].color = "green";
+ }
+ }
+
+ for (let k = 0; k <= index; k++) {
+ array[k].color = "green";
}
+ await sleep(500);
+ setArray([...array]);
}
}
diff --git a/src/components/SortingAlgorithms/MergeSort.js b/src/components/SortingAlgorithms/MergeSort.js
old mode 100644
new mode 100755
index 9f80564..277dc71
--- a/src/components/SortingAlgorithms/MergeSort.js
+++ b/src/components/SortingAlgorithms/MergeSort.js
@@ -37,9 +37,8 @@ const mergeSortHelper = async (array, left, right, setArray) => {
* @param {function} setArray - State setter to update the array in the UI
*/
const merge = async (array, left, mid, right, setArray) => {
- // Create copies of the left and right subarrays
- const leftArr = array.slice(left, mid + 1);
- const rightArr = array.slice(mid + 1, right + 1);
+ const leftArr = array.slice(left, mid + 1).map(item => item.value);
+ const rightArr = array.slice(mid + 1, right + 1).map(item => item.value);
let i = 0, // Pointer for left subarray
j = 0, // Pointer for right subarray
@@ -48,31 +47,46 @@ const merge = async (array, left, mid, right, setArray) => {
// Compare elements from left and right subarrays and merge them in sorted order
while (i < leftArr.length && j < rightArr.length) {
if (leftArr[i] <= rightArr[j]) {
- array[k] = leftArr[i];
+ array[k].value = leftArr[i];
i++;
} else {
- array[k] = rightArr[j];
+ array[k].value = rightArr[j];
j++;
}
k++;
+ if (left === 0) {
+ array[k - 1].color = "green";
+ } else {
+ array[k - 1].color = "orange";
+ }
await sleep(500);
setArray([...array]);
}
// Add remaining elements from left subarray
while (i < leftArr.length) {
- array[k] = leftArr[i];
+ array[k].value = leftArr[i];
i++;
k++;
+ if (left === 0) {
+ array[k - 1].color = "green";
+ } else {
+ array[k - 1].color = "orange";
+ }
await sleep(500);
setArray([...array]);
}
// Add remaining elements from right subarray
while (j < rightArr.length) {
- array[k] = rightArr[j];
+ array[k].value = rightArr[j];
j++;
k++;
+ if (left === 0) {
+ array[k - 1].color = "green";
+ } else {
+ array[k - 1].color = "orange";
+ }
await sleep(500);
setArray([...array]);
}
diff --git a/src/components/SortingAlgorithms/QuickSort.js b/src/components/SortingAlgorithms/QuickSort.js
old mode 100644
new mode 100755
index 2b2d0d7..dd0df15
--- a/src/components/SortingAlgorithms/QuickSort.js
+++ b/src/components/SortingAlgorithms/QuickSort.js
@@ -3,8 +3,12 @@ import { sleep } from "../Helper/helper";
export const QuickSort = async (array, l, u, setArray) => {
if (u > l) {
const p = await Partition(array, l, u, setArray);
- QuickSort(array, l, p - 1, setArray);
- QuickSort(array, p + 1, u, setArray);
+ await QuickSort(array, l, p - 1, setArray);
+ await QuickSort(array, p + 1, u, setArray);
+ } else if (u === l && u >= 0) {
+ array[u].color = "green";
+ await sleep(50);
+ setArray([...array]);
}
};
@@ -13,10 +17,10 @@ const Partition = async (array, l, u, setArray) => {
let start = l,
end = u;
while (start < end) {
- while (array[start] <= array[p]) {
+ while (array[start].value <= array[p].value) {
start++;
}
- while (array[end] > array[p]) {
+ while (array[end].value > array[p].value) {
end--;
}
if (start < end) {
@@ -24,6 +28,7 @@ const Partition = async (array, l, u, setArray) => {
}
}
[array[end], array[l]] = [array[l], array[end]];
+ array[end].color = "green";
await sleep(500);
setArray([...array]);
return end;
diff --git a/src/components/SortingAlgorithms/SelectionSort.js b/src/components/SortingAlgorithms/SelectionSort.js
old mode 100644
new mode 100755
index eab2bd9..a6e2d8c
--- a/src/components/SortingAlgorithms/SelectionSort.js
+++ b/src/components/SortingAlgorithms/SelectionSort.js
@@ -5,7 +5,7 @@ export async function SelectionSort(array, setArray) {
let min = i;
for (let j = i + 1; j < array.length; j++) {
- if (array[j] < array[min]) {
+ if (array[j].value < array[min].value) {
min = j;
}
}
@@ -15,7 +15,12 @@ export async function SelectionSort(array, setArray) {
array[min] = temp;
// console.log(array);
}
+ array[i].color = "green";
await sleep(500);
setArray([...array]);
}
+
+ array[array.length - 1].color = "green";
+ await sleep(500);
+ setArray([...array]);
}
diff --git a/src/components/SortingBars.jsx b/src/components/SortingBars.jsx
old mode 100644
new mode 100755
index e37765e..75a3ab2
--- a/src/components/SortingBars.jsx
+++ b/src/components/SortingBars.jsx
@@ -8,11 +8,12 @@ const SortingBars = (props) => {
{props.array.map((bar) => (