Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
S
Sorting-Visualizer
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Requirements
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Locked files
Build
Pipelines
Jobs
Pipeline schedules
Test cases
Artifacts
Deploy
Releases
Package registry
Container registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Code review analytics
Issue analytics
Insights
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Daniel Runte
Sorting-Visualizer
Merge requests
!3
implemented MergeSort
Code
Review changes
Check out branch
Download
Patches
Plain diff
Merged
implemented MergeSort
feature/MergeSort
into
main
Overview
0
Commits
1
Pipelines
0
Changes
5
Merged
Daniel Runte
requested to merge
feature/MergeSort
into
main
9 months ago
Overview
0
Commits
1
Pipelines
0
Changes
5
Expand
0
0
Merge request reports
Compare
main
main (base)
and
latest version
latest version
daf09a14
1 commit,
9 months ago
5 files
+
187
−
15
Inline
Compare changes
Side-by-side
Inline
Show whitespace changes
Show one file at a time
Files
5
Search (e.g. *.vue) (Ctrl+P)
src/MergeSort.js
0 → 100644
+
122
−
0
Options
async
function
MergeSort
(
EingangsArray
,
startIdx
,
endIdx
,
arrayCopy
,
updateBars
,
setColor
,
sortSpeed
)
{
if
(
startIdx
>=
endIdx
)
return
;
// Split array
const
cuttingEdge
=
Math
.
floor
((
startIdx
+
endIdx
)
/
2
);
// Recursively sort both halves
await
MergeSort
(
EingangsArray
,
startIdx
,
cuttingEdge
,
arrayCopy
,
updateBars
,
setColor
,
sortSpeed
);
await
MergeSort
(
EingangsArray
,
cuttingEdge
+
1
,
endIdx
,
arrayCopy
,
updateBars
,
setColor
,
sortSpeed
);
// Merge halves back togeteher
await
merge
(
EingangsArray
,
startIdx
,
cuttingEdge
,
endIdx
,
arrayCopy
,
updateBars
,
setColor
,
sortSpeed
);
}
async
function
merge
(
EingangsArray
,
startIdx
,
middleIdx
,
endIdx
,
arrayCopy
,
updateBars
,
setColor
,
sortSpeed
)
{
let
i
=
startIdx
;
let
j
=
middleIdx
+
1
;
let
k
=
startIdx
;
const
bars
=
document
.
querySelectorAll
(
'
.bar
'
);
// get all bars
const
sortSpeedSwitch
=
Number
(
sortSpeed
);
// index exist?
const
isValidIndex
=
(
index
)
=>
index
>=
0
&&
index
<
bars
.
length
;
// Merge halves back togeteher
while
(
i
<=
middleIdx
&&
j
<=
endIdx
)
{
if
(
isValidIndex
(
i
)
&&
isValidIndex
(
j
))
{
// Change color of compared bars
bars
[
i
].
style
.
backgroundColor
=
'
red
'
;
bars
[
j
].
style
.
backgroundColor
=
'
red
'
;
}
switch
(
sortSpeedSwitch
)
{
case
0
:
break
;
// No delay
case
40
:
await
new
Promise
(
resolve
=>
setTimeout
(
resolve
,
90
));
break
;
case
100
:
await
new
Promise
(
resolve
=>
setTimeout
(
resolve
,
200
));
break
;
}
if
(
EingangsArray
[
i
]
<=
EingangsArray
[
j
])
{
arrayCopy
[
k
]
=
EingangsArray
[
i
];
i
++
;
}
else
{
arrayCopy
[
k
]
=
EingangsArray
[
j
];
j
++
;
}
// Update Array
await
updateArrayState
(
EingangsArray
,
arrayCopy
,
startIdx
,
endIdx
,
updateBars
,
sortSpeed
);
if
(
isValidIndex
(
i
-
1
))
bars
[
i
-
1
].
style
.
backgroundColor
=
''
;
// default colr
if
(
isValidIndex
(
j
-
1
))
bars
[
j
-
1
].
style
.
backgroundColor
=
''
;
k
++
;
}
// Copy from the LEFT half
while
(
i
<=
middleIdx
)
{
switch
(
sortSpeedSwitch
)
{
case
0
:
break
;
// No delay
case
40
:
await
new
Promise
(
resolve
=>
setTimeout
(
resolve
,
90
));
break
;
case
100
:
await
new
Promise
(
resolve
=>
setTimeout
(
resolve
,
200
));
break
;
}
arrayCopy
[
k
]
=
EingangsArray
[
i
];
await
updateArrayState
(
EingangsArray
,
arrayCopy
,
startIdx
,
endIdx
,
updateBars
,
sortSpeed
);
if
(
isValidIndex
(
i
))
bars
[
i
].
style
.
backgroundColor
=
''
;
i
++
;
k
++
;
}
// Copy from the RIGHT half
while
(
j
<=
endIdx
)
{
switch
(
sortSpeedSwitch
)
{
case
0
:
break
;
// No delay
case
40
:
await
new
Promise
(
resolve
=>
setTimeout
(
resolve
,
90
));
break
;
case
100
:
await
new
Promise
(
resolve
=>
setTimeout
(
resolve
,
200
));
break
;
}
arrayCopy
[
k
]
=
EingangsArray
[
j
];
await
updateArrayState
(
EingangsArray
,
arrayCopy
,
startIdx
,
endIdx
,
updateBars
,
sortSpeed
);
if
(
isValidIndex
(
j
))
bars
[
j
].
style
.
backgroundColor
=
''
;
j
++
;
k
++
;
}
// Copy merged values back
for
(
let
i
=
startIdx
;
i
<=
endIdx
;
i
++
)
{
EingangsArray
[
i
]
=
arrayCopy
[
i
];
}
// adding to class 'finished'
if
(
endIdx
-
startIdx
+
1
===
EingangsArray
.
length
)
{
setColor
(
0
);
}
}
async
function
updateArrayState
(
EingangsArray
,
arrayCopy
,
startIdx
,
endIdx
,
updateBars
,
sortSpeed
)
{
updateBars
([...
arrayCopy
]);
await
new
Promise
(
resolve
=>
setTimeout
(
resolve
,
sortSpeed
));
}
export
default
async
function
startMergeSort
(
EingangsArray
,
updateBars
,
setFinish
,
sortSpeed
)
{
const
arrayCopy
=
[...
EingangsArray
];
await
MergeSort
(
EingangsArray
,
0
,
EingangsArray
.
length
-
1
,
arrayCopy
,
updateBars
,
setFinish
,
sortSpeed
);
}
Loading