todas as opções
bianca  ]
[ Fonte: pdqsort  ]

Pacote: pdqsort-dev (0.0.0+git20180419-2.1)

Links para pdqsort-dev

Screenshot

Baixe o pacote-fonte pdqsort:

Mantenedor(a):

Fontes externas:

Pacotes similares:

pattern-defeating quicksort compile-time c++ library

Pattern-defeating quicksort (pdqsort) is a novel sorting algorithm that combines the fast average case of randomized quicksort with the fast worst case of heapsort, while achieving linear time on inputs with certain patterns. pdqsort is an extension and improvement of David Mussers introsort.

This package provides c++ header with drop-in replacement for std::sort.

Download de pdqsort-dev

Baixe para todas as arquiteturas disponíveis
Arquitetura Tamanho do pacote Tamanho instalado Arquivos
all 9.8 kB37.0 kB [lista de arquivos]