Inicio > Term: weak-heap sort
weak-heap sort
A sort algorithm that builds a weak-heap, then repeatedly extracts the maximum item. In the worst case, the run time is O(n log n + 0.1 n).
- Parte del discurso: noun
- Industria/ámbito: Ciencia informática
- Categoría: Algoritmos & Estructura de Datos
- Government Agency: NIST
0
Creador
- GeorgeV
-
(Gold) 1123 puntos - 100% positive feedback
