FilesExpand file tree

 master

/

desc.json

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

14 lines (14 loc) · 829 Bytes

 master

/

desc.json

Copy path

Top

File metadata and controls

• Code
• Blame

14 lines (14 loc) · 829 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

{

"Merge Sort": "In computer science, merge sort (also commonly spelled mergesort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output. Mergesort is a divide and conquer algorithm that was invented by John von Neumann in 1945. A detailed description and analysis of bottom-up mergesort appeared in a report by Goldstine and Neumann as early as 1948.",

"Complexity": {

"time": "average $O(n \\, log \\, n)$",

"space": "worst $O(n)$"

},

"References": [

"<a href='https://en.wikipedia.org/wiki/Merge_sort'>Wikipedia</a>"

],

"files": {

"bottom_up": "Bottom-up implementation",

"top_down_list": "Top-down implementation using lists"

}

}