source code spacing fix

DeeAyDan · DeeAyDan · commit f828a07704dd · 2025-05-08T19:06:54.000+02:00
diff --git a/src/algorithms/HeapSort.svelte b/src/algorithms/HeapSort.svelte
@@ -253,39 +253,39 @@
 
 	selectedAlgorithmSourceCode.set(`
 function heapSort() {
-   const n = nodes.length;
+  const n = nodes.length;
  \n
-   for (let i = Math.floor(n / 2) - 1; i >= 0; i--) {
-      heapify(n, i);
-   }
+  for (let i = Math.floor(n / 2) - 1; i >= 0; i--) {
+    heapify(n, i);
+  }
  \n
-   for (let i = n - 1; i > 0; i--) {
-      swap(0, i);
-      heapify(i, 0);
-   }
+  for (let i = n - 1; i > 0; i--) {
+    swap(0, i);
+    heapify(i, 0);
+  }
 }
  \n
 function swap(i, j) {
-   [nodes[i], nodes[j]] = [nodes[j], nodes[i]];
+  [nodes[i], nodes[j]] = [nodes[j], nodes[i]];
 }
  \n
 function heapify(n, i) {
-   let largest = i;
-   const l = 2 * i + 1;
-   const r = 2 * i + 2;
+  let largest = i;
+  const l = 2 * i + 1;
+  const r = 2 * i + 2;
  \n
-   if (l < n && nodes[l] > nodes[largest]) {
-      largest = l;
-   }
+  if (l < n && nodes[l] > nodes[largest]) {
+    largest = l;
+  }
  \n 
-   if (r < n && nodes[r] > nodes[largest]) {
-      largest = r;
-   }
+  if (r < n && nodes[r] > nodes[largest]) {
+    largest = r;
+  }
  \n
-   if (largest !== i) {
-      swap(i, largest);
-      heapify(n, largest);
-   }
+  if (largest !== i) {
+    swap(i, largest);
+    heapify(n, largest);
+  }
 }
 `);
 </script>
@@ -328,6 +328,8 @@ function heapify(n, i) {
 					: activeNodes.includes(node.index)
 						? '#ffd700'
 						: '#2f4f4f'}
+				stroke="aliceblue"
+				stroke-width="2"
 			/>
 			<text
 				x={node.x}
diff --git a/src/algorithms/InsertionSort.svelte b/src/algorithms/InsertionSort.svelte
@@ -182,20 +182,20 @@
 
 	// ==== Forráskód megjelenítés ====
 	selectedAlgorithmSourceCode.set(
-`function insersionSort(array){
+`function insersionSort(array) {
  \n
-   for (let index = 1; index < array.length; index++){
+  for (let index = 1; index < array.length; index++){
  \n
-      let temp = array[index];
-      let j = index - 1;
+    let temp = array[index];
+    let j = index - 1;
  \n
-      while (j >= 0 && array[j] > temp){
-         array[j + 1] = array[j];
-         j--;
-      }
+    while (j >= 0 && array[j] > temp){
+      array[j + 1] = array[j];
+      j--;
+    }
  \n
-      array[j + 1] = temp;
-   }
+    array[j + 1] = temp;
+  }
 }`);
 </script>
 
diff --git a/src/algorithms/MergeSort.svelte b/src/algorithms/MergeSort.svelte
@@ -244,52 +244,52 @@
 
 	// ==== Forráskód megjelenítés ====
 	selectedAlgorithmSourceCode.set(
-`function mergeSort(array, startIndex = 0){
+`function mergeSort(array, startIndex = 0) {
  \n
-   if (array.length < 2){
-      return;
-   }
+  if (array.length < 2){
+    return;
+  }
 	   \n
-   const middle = Math.floor(array.length / 2);
-   const left = array.slice(0, middle);
-   const right = array.slice(middle);
+  const middle = Math.floor(array.length / 2);
+  const left = array.slice(0, middle);
+  const right = array.slice(middle);
  \n
-   mergeSort(left, startIndex);
-   mergeSort(right, startIndex + middle);
+  mergeSort(left, startIndex);
+  mergeSort(right, startIndex + middle);
  \n
-   merge(left, right, array, startIndex);
+  merge(left, right, array, startIndex);
 }
  \n
-function merge(left, right, merged, startIndex){
+function merge(left, right, merged, startIndex) {
  \n
-   let i = 0,
-   l = 0,
-   r = 0;
+  let i = 0,
+  l = 0,
+  r = 0;
  \n
-   while (l < left.length && r < right.length){
-      if (left[l] <= right[r]) {
-         merged[i] = left[l++];
-      } else {
-         merged[i] = right[r++];
-      }
-      data[startIndex + i] = merged[i];
-      data = [...data];
-      i++;
-   }
- \n 
-   while (l < left.length) {
+  while (l < left.length && r < right.length) {
+    if (left[l] <= right[r]) {
       merged[i] = left[l++];
-      data[startIndex + i] = merged[i];
-      data = [...data];
-      i++;
-   }
- \n
-   while (r < right.length) {
+    } else {
       merged[i] = right[r++];
-      data[startIndex + i] = merged[i];
-      data = [...data];
-      i++;
-   }
+    }
+    data[startIndex + i] = merged[i];
+    data = [...data];
+    i++;
+  }
+ \n 
+  while (l < left.length) {
+    merged[i] = left[l++];
+    data[startIndex + i] = merged[i];
+    data = [...data];
+    i++;
+  }
+ \n
+  while (r < right.length) {
+    merged[i] = right[r++];
+    data[startIndex + i] = merged[i];
+    data = [...data];
+    i++;
+  }
 }`);
 </script>
 
diff --git a/src/algorithms/QuickSort.svelte b/src/algorithms/QuickSort.svelte
@@ -186,29 +186,29 @@
 	selectedAlgorithmSourceCode.set(
 `function quickSort(arr, left, right){
  \n
-   if (left < right){
-      let pivotIndex = partition(arr, left, right);
-      quickSort(arr, left, pivotIndex - 1);
-      quickSort(arr, pivotIndex + 1, right);
-   }
+  if (left < right){
+    let pivotIndex = partition(arr, left, right);
+    quickSort(arr, left, pivotIndex - 1);
+    quickSort(arr, pivotIndex + 1, right);
+  }
 }
  \n
 function partition(arr, left, right){
  \n
-   let pivot = arr[right];
-   let i = left - 1;
+  let pivot = arr[right];
+  let i = left - 1;
  \n
-   for (let j = left; j < right; j++){
-      activeIndex = j;
-      if (arr[j] <= pivot){
-         i++;
-         [arr[i], arr[j]] = [arr[j], arr[i]];
-      }
-   }
+  for (let j = left; j < right; j++){
+    activeIndex = j;
+    if (arr[j] <= pivot){
+      i++;
+      [arr[i], arr[j]] = [arr[j], arr[i]];
+    }
+  }
  \n
-   [arr[i + 1], arr[right]] = [arr[right], arr[i + 1]];
-   pivotIndex = null;
-   return i + 1;
+  [arr[i + 1], arr[right]] = [arr[right], arr[i + 1]];
+  pivotIndex = null;
+  return i + 1;
 }`);
 </script>
 
