Merge-insertion sort
id:
merge-insertion-sort-320-2099079
title:
Merge-insertion sort
text:
In computer science, merge-insertion sort or the Ford–Johnson algorithm is a comparison sorting algorithm published in 1959 by L. R. Ford Jr. and Selmer M. Johnson. It uses fewer comparisons in the worst case than the best previously known algorithms, binary insertion sort and merge sort, and for 20 years it was the sorting algorithm with the fewest known comparisons. Although not of practical significance, it remains of theoretical interest in connection with the problem of sorting with a minim
brand slug:
wiki
category slug:
encyclopedia
description:
Type of comparison sorting algorithm
original url:
https://en.wikipedia.org/wiki/Merge-insertion_sort
date created:
date modified:
2024-04-03T17:15:31Z
main entity:
{"identifier":"Q56277713","url":"https://www.wikidata.org/entity/Q56277713"}
image:
fields total:
13
integrity:
14