Merge-insertion sort
Sorting algorithm
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.
Nº Q56277713 ★
Comum · Saberes
Merge-insertion sort
Sorting algorithm
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.
Último preço
—
Preço mínimo
—
Mediana 7 d
—
Vendas 30 d
0
Faixa 30 d
—
Em circulação
0
Cotação
mediana
mín – máx
vendas
Sem vendas no período
Ver tabela
| Data | mediana | Mín | Máx | vendas |
|---|
Histórico de vendas
- Última venda
- —
- Média 30 d
- —
- Mínima 30 d
- —
- Máxima 30 d
- —
- Vendas 7 d
- 0
- Vendas 30 d
- 0
Ainda sem vendas.
Vendas anônimas: sem comprador nem vendedor. Os números contam só vendas entre jogadores.
Na Wikipédia
Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.
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 minimum number of comparisons. The same algorithm may have also been independently discovered by Stanisław Trybuła and Czen Ping.
Texto: Wikipédia em inglês, CC BY-SA 4.0. · Imagem: Abdous-sepehr (CC BY-SA 4.0) ·
Cartas próximas
-
Merge sort
Algoritmo de ordenação
Nº Q189057 ★★★
Sem ofertas
-
Odd-even sort
Nº Q578580 ★
Sem ofertas
-
A
Algoritmo de Johnson
Nº Q2345824 ★
Sem ofertas
-
Algoritmo de Ford-Fulkerson
Nº Q284695 ★
Sem ofertas
-
F
Fürer's algorithm
Integer multiplication algorithm for very large numbers
Nº Q2835790 ★
Sem ofertas
-
Isomorfismo de Curry-Howard
Nº Q975734 ★★
Sem ofertas