Skip to content

Commit f828a07

Browse files
DeeAyDanDeeAyDan
committed
source code spacing fix
1 parent 7cec6ef commit f828a07

File tree

4 files changed

+87
-85
lines changed

4 files changed

+87
-85
lines changed

‎src/algorithms/HeapSort.svelte

Lines changed: 24 additions & 22 deletions
Original file line numberDiff line numberDiff line change
@@ -253,39 +253,39 @@
253253
254254
selectedAlgorithmSourceCode.set(`
255255
function heapSort() {
256-
const n = nodes.length;
256+
const n = nodes.length;
257257
\n
258-
for (let i = Math.floor(n / 2) - 1; i >= 0; i--) {
259-
heapify(n, i);
260-
}
258+
for (let i = Math.floor(n / 2) - 1; i >= 0; i--) {
259+
heapify(n, i);
260+
}
261261
\n
262-
for (let i = n - 1; i > 0; i--) {
263-
swap(0, i);
264-
heapify(i, 0);
265-
}
262+
for (let i = n - 1; i > 0; i--) {
263+
swap(0, i);
264+
heapify(i, 0);
265+
}
266266
}
267267
\n
268268
function swap(i, j) {
269-
[nodes[i], nodes[j]] = [nodes[j], nodes[i]];
269+
[nodes[i], nodes[j]] = [nodes[j], nodes[i]];
270270
}
271271
\n
272272
function heapify(n, i) {
273-
let largest = i;
274-
const l = 2 * i + 1;
275-
const r = 2 * i + 2;
273+
let largest = i;
274+
const l = 2 * i + 1;
275+
const r = 2 * i + 2;
276276
\n
277-
if (l < n && nodes[l] > nodes[largest]) {
278-
largest = l;
279-
}
277+
if (l < n && nodes[l] > nodes[largest]) {
278+
largest = l;
279+
}
280280
\n
281-
if (r < n && nodes[r] > nodes[largest]) {
282-
largest = r;
283-
}
281+
if (r < n && nodes[r] > nodes[largest]) {
282+
largest = r;
283+
}
284284
\n
285-
if (largest !== i) {
286-
swap(i, largest);
287-
heapify(n, largest);
288-
}
285+
if (largest !== i) {
286+
swap(i, largest);
287+
heapify(n, largest);
288+
}
289289
}
290290
`);
291291
</script>
@@ -328,6 +328,8 @@ function heapify(n, i) {
328328
: activeNodes.includes(node.index)
329329
? '#ffd700'
330330
: '#2f4f4f'}
331+
stroke="aliceblue"
332+
stroke-width="2"
331333
/>
332334
<text
333335
x={node.x}

‎src/algorithms/InsertionSort.svelte

Lines changed: 10 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -182,20 +182,20 @@
182182
183183
// ==== Forráskód megjelenítés ====
184184
selectedAlgorithmSourceCode.set(
185-
`function insersionSort(array){
185+
`function insersionSort(array) {
186186
\n
187-
for (let index = 1; index < array.length; index++){
187+
for (let index = 1; index < array.length; index++){
188188
\n
189-
let temp = array[index];
190-
let j = index - 1;
189+
let temp = array[index];
190+
let j = index - 1;
191191
\n
192-
while (j >= 0 && array[j] > temp){
193-
array[j + 1] = array[j];
194-
j--;
195-
}
192+
while (j >= 0 && array[j] > temp){
193+
array[j + 1] = array[j];
194+
j--;
195+
}
196196
\n
197-
array[j + 1] = temp;
198-
}
197+
array[j + 1] = temp;
198+
}
199199
}`);
200200
</script>
201201

‎src/algorithms/MergeSort.svelte

Lines changed: 36 additions & 36 deletions
Original file line numberDiff line numberDiff line change
@@ -244,52 +244,52 @@
244244
245245
// ==== Forráskód megjelenítés ====
246246
selectedAlgorithmSourceCode.set(
247-
`function mergeSort(array, startIndex = 0){
247+
`function mergeSort(array, startIndex = 0) {
248248
\n
249-
if (array.length < 2){
250-
return;
251-
}
249+
if (array.length < 2){
250+
return;
251+
}
252252
\n
253-
const middle = Math.floor(array.length / 2);
254-
const left = array.slice(0, middle);
255-
const right = array.slice(middle);
253+
const middle = Math.floor(array.length / 2);
254+
const left = array.slice(0, middle);
255+
const right = array.slice(middle);
256256
\n
257-
mergeSort(left, startIndex);
258-
mergeSort(right, startIndex + middle);
257+
mergeSort(left, startIndex);
258+
mergeSort(right, startIndex + middle);
259259
\n
260-
merge(left, right, array, startIndex);
260+
merge(left, right, array, startIndex);
261261
}
262262
\n
263-
function merge(left, right, merged, startIndex){
263+
function merge(left, right, merged, startIndex) {
264264
\n
265-
let i = 0,
266-
l = 0,
267-
r = 0;
265+
let i = 0,
266+
l = 0,
267+
r = 0;
268268
\n
269-
while (l < left.length && r < right.length){
270-
if (left[l] <= right[r]) {
271-
merged[i] = left[l++];
272-
} else {
273-
merged[i] = right[r++];
274-
}
275-
data[startIndex + i] = merged[i];
276-
data = [...data];
277-
i++;
278-
}
279-
\n
280-
while (l < left.length) {
269+
while (l < left.length && r < right.length) {
270+
if (left[l] <= right[r]) {
281271
merged[i] = left[l++];
282-
data[startIndex + i] = merged[i];
283-
data = [...data];
284-
i++;
285-
}
286-
\n
287-
while (r < right.length) {
272+
} else {
288273
merged[i] = right[r++];
289-
data[startIndex + i] = merged[i];
290-
data = [...data];
291-
i++;
292-
}
274+
}
275+
data[startIndex + i] = merged[i];
276+
data = [...data];
277+
i++;
278+
}
279+
\n
280+
while (l < left.length) {
281+
merged[i] = left[l++];
282+
data[startIndex + i] = merged[i];
283+
data = [...data];
284+
i++;
285+
}
286+
\n
287+
while (r < right.length) {
288+
merged[i] = right[r++];
289+
data[startIndex + i] = merged[i];
290+
data = [...data];
291+
i++;
292+
}
293293
}`);
294294
</script>
295295

‎src/algorithms/QuickSort.svelte

Lines changed: 17 additions & 17 deletions
Original file line numberDiff line numberDiff line change
@@ -186,29 +186,29 @@
186186
selectedAlgorithmSourceCode.set(
187187
`function quickSort(arr, left, right){
188188
\n
189-
if (left < right){
190-
let pivotIndex = partition(arr, left, right);
191-
quickSort(arr, left, pivotIndex - 1);
192-
quickSort(arr, pivotIndex + 1, right);
193-
}
189+
if (left < right){
190+
let pivotIndex = partition(arr, left, right);
191+
quickSort(arr, left, pivotIndex - 1);
192+
quickSort(arr, pivotIndex + 1, right);
193+
}
194194
}
195195
\n
196196
function partition(arr, left, right){
197197
\n
198-
let pivot = arr[right];
199-
let i = left - 1;
198+
let pivot = arr[right];
199+
let i = left - 1;
200200
\n
201-
for (let j = left; j < right; j++){
202-
activeIndex = j;
203-
if (arr[j] <= pivot){
204-
i++;
205-
[arr[i], arr[j]] = [arr[j], arr[i]];
206-
}
207-
}
201+
for (let j = left; j < right; j++){
202+
activeIndex = j;
203+
if (arr[j] <= pivot){
204+
i++;
205+
[arr[i], arr[j]] = [arr[j], arr[i]];
206+
}
207+
}
208208
\n
209-
[arr[i + 1], arr[right]] = [arr[right], arr[i + 1]];
210-
pivotIndex = null;
211-
return i + 1;
209+
[arr[i + 1], arr[right]] = [arr[right], arr[i + 1]];
210+
pivotIndex = null;
211+
return i + 1;
212212
}`);
213213
</script>
214214

0 commit comments

Comments
 (0)