- // Swap found minimum with first element
- if (minIndex !== i) {
- [arr[i], arr[minIndex]] = [arr[minIndex], arr[i]];
- }
- }
-
- return arr;
-}`;
- case "insertion":
- return `function insertionSort(arr) {
- const n = arr.length;
-
- for (let i = 1; i < n; i++) {
- // Store current element to be inserted
- let key = arr[i];
- let j = i - 1;
-
- // Move elements greater than key
- // to one position ahead
- while (j >= 0 && arr[j] > key) {
- arr[j + 1] = arr[j];
- j--;
- }
-
- // Insert the key at correct position
- arr[j + 1] = key;
- }
-
- return arr;
-}`;
- case "quicksort":
- return `function quickSort(arr, low = 0, high = arr.length - 1) {
- if (low < high) {
- // Find pivot element such that
- // elements smaller than pivot are on the left
- // elements greater than pivot are on the right
- const pivotIndex = partition(arr, low, high);
-
- // Recursively sort elements before and after pivot
- quickSort(arr, low, pivotIndex - 1);
- quickSort(arr, pivotIndex + 1, high);
- }
-
- return arr;
-}
+
+
+
+ {t("explanation.steps")}
+
+
+ {t("explanation.cases")}
+
+
+ {t("explanation.code")}
+
+
-function partition(arr, low, high) {
- // Choose rightmost element as pivot
- const pivot = arr[high];
- let i = low - 1;
+
+
+
+ {currentAlgorithm.steps.map((step, index) => (
+
{step}
+ ))}
+
+
- // Compare each element with pivot
- for (let j = low; j < high; j++) {
- if (arr[j] <= pivot) {
- i++;
- [arr[i], arr[j]] = [arr[j], arr[i]];
- }
- }
+
+