GitHub

QuickSort em Java

Este programa implementa o algoritmo de ordenação QuickSort em Java. Ele recebe um array de inteiros, exibe os valores desordenados, ordena o array utilizando o QuickSort e, em seguida, exibe os ...
GitHub

franklaercio/quicksort-vs-mergesort-java

Este trabalho irá comparar dois algoritmos de ordenação, o Quicksort e o MergesortTest. Eles partem da mesma estratégia de dividir para conquistar e possuem a mesma complexidade no melhor e pior caso.
Scientific Research Publishing

Wild, S., Nebel, M.E. and Neininger, R. (2013) Average Case and Distributional Analysis of Java 7’s Dual Pivot Quicksort. arXiv preprint arXiv:1304.0988.

ABSTRACT: Sorting an array of objects such as integers, bytes, floats, etc is considered as one of the most important problems in Computer Science. Quicksort is an effective and wide studied sorting ...
Scientific Research Publishing

Wild, S., Nebel, M.E., Reitzig, R. and Laube, U. (2013) Engineering Java 7’s Dual Pivot Quicksort. Proceedings of the ALENEX 2013, New Orleans, Louisiana, USA, 7 January 2013 ...

ABSTRACT: Sorting an array of objects such as integers, bytes, floats, etc is considered as one of the most important problems in Computer Science. Quicksort is an effective and wide studied sorting ...