search

bcribas / benchmark-ordenacao

Benchmark simples para algoritmos de ordenação. Envolve conteúdo da disciplina EDA-2 da UnB/FGA
GNU General Public License v2.0
76 stars 15 forks source link

Adicionando introsort com heap #2

Closed Joao-Moura closed 3 years ago

Joao-Moura commented 3 years ago

Adição do introsortquickheaplongjmp ao benchmark utilizando os algorítmos quicksort, heapsort e insertionsort.

Compilando o arquivo

BINARY="introsortquickheaplongjmp" make time.aleatorio time.muitosrepetidos time.ordenado time.quaseordenado time.reverso

Execução dos testes

--- time.aleatorio ---
# introsortquickheaplongjmp
 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.01 0.02 0.05 0.09 0.20
--- time.muitosrepetidos ---
# introsortquickheaplongjmp
 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.01 0.01 0.03 0.08 0.16
--- time.ordenado ---
# introsortquickheaplongjmp
 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.01 0.03 0.07 0.14
--- time.quaseordenado ---
# introsortquickheaplongjmp
 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.01 0.03 0.07 0.14
--- time.reverso ---
# introsortquickheaplongjmp
 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.01 0.02 0.03 0.07 0.16