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 ★
Común · 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 precio
—
Precio mínimo
—
Mediana 7 d
—
Ventas 30 d
0
Rango 30 d
—
En circulación
0
Cotización
mediana
mín – máx
ventas
Sin ventas en el periodo
Ver tabla
| Fecha | mediana | Mín | Máx | ventas |
|---|
Historial de ventas
- Última venta
- —
- Media 30 d
- —
- Mínimo 30 d
- —
- Máximo 30 d
- —
- Ventas 7 d
- 0
- Ventas 30 d
- 0
Aún no hay ventas.
Ventas anónimas: sin comprador ni vendedor. Las cifras solo cuentan ventas entre jugadores.
En Wikipedia
Texto en inglés Aún no hay artículo en tu idioma: extracto en 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: Wikipedia en inglés, CC BY-SA 4.0. · Imagen: Abdous-sepehr (CC BY-SA 4.0) ·
Cartas cercanas
-
Ordenamiento por mezcla
Nº Q189057 ★★★
Sin ofertas
-
Ordenamiento impar-par
Nº Q578580 ★
Sin ofertas
-
A
Algoritmo de Johnson
Nº Q2345824 ★
Sin ofertas
-
Algoritmo de Ford-Fulkerson
Nº Q284695 ★
Sin ofertas
-
A
Algoritmo de Fürer
Algoritmo rapido de multiplicacion instante asiduamente para multi-digito numeros
Nº Q2835790 ★
Sin ofertas
-
Correspondencia de Curry-Howard
Isomorfismo entre los programas de ordenador y las demostraciones matemáticas
Nº Q975734 ★★
Sin ofertas