Merge sort
id:
merge-sort-169-3864569
title:
Merge sort
text:
In computer science, merge sort is an efficient, general-purpose, and comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the relative order of equal elements is the same in the input and output. Merge sort is a divide-and-conquer algorithm that was invented by John von Neumann in 1945. A detailed description and analysis of bottom-up merge sort appeared in a report by Goldstine and von Neumann as early as 1948.
brand slug:
wiki
category slug:
encyclopedia
description:
Divide and conquer sorting algorithm
original url:
https://en.wikipedia.org/wiki/Merge_sort
date created:
2001-10-25T19:39:36Z
date modified:
2024-08-31T09:05:21Z
main entity:
{"identifier":"Q189057","url":"https://www.wikidata.org/entity/Q189057"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/c/cc/Merge-sort-example-300px.gif","width":300,"height":180}
fields total:
13
integrity:
16