You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: app/visualizer/sorting/mergesort/content.jsx
-67Lines changed: 0 additions & 67 deletions
Original file line number
Diff line number
Diff line change
@@ -6,17 +6,6 @@ const content = () => {
6
6
`Merge Sort is particularly useful when sorting linked lists (where random access is expensive) and is the algorithm of choice for many standard library sorting implementations when stability is required. It's also commonly used in external sorting where data doesn't fit in memory.`,
7
7
];
8
8
9
-
constdivide=[
10
-
{points : "Split the array into two halves: [38, 27, 43] and [3, 9, 82, 10]"},
11
-
{points : "Recursively split each half until single elements remain"},
12
-
];
13
-
14
-
constmerge=[
15
-
{points : "Merge single elements into sorted pairs: [27, 38], [3, 43], [9, 82], [10]"},
0 commit comments