QuickSort 1.6

Publisher's description
File details
Antivirus report
"QuickSort is an in-memory recursive sort"
Published by Canadian Mind Products on 31 May 2012
Publisher support
QuickSort is an implementation of Tony Hoare's classic
QuickSort. QuickSort works by choosing a pivot point and
ensuring all elements below the pivot point are small all
above are big, (i.e. smaller than the pivot) Then it
recursively splites the upper and lower halves, repeating
the process. QuickSort is an internal sort written in Java.
Both RadixSort and HeapSort are quicker than QuickSort.
QuickSort can also take pathologically long times if there
is too much pre-existing order in the items to be sorted.
This code is primarily for teaching purposes. It sorts using
a routine you provide to compare two elements to be sorted.

You can test it with
java.exe com.mindprod.quicksort.TestQuickSort

Requirements: Java 1.5+

What's new in this version: bundle with pad and ant scripts

  • Size:

    80.06 KB

  • License:

    Freeware

  • OS:

    Java, Linux, Mac OS, Unix, Windows

  • Price:

    $0.00

Antivirus information

Download3K has downloaded and tested QuickSort on 31 May 2012 with some of Today's best antivirus engines and you can find below, for your convenience, the scan results:

  • Bitdefender:

    Clean

  • NOD 32:

    Clean

  • Avira:

    Clean

  • Kaspersky:

    Clean
QuickSort Antivirus Report
Complete antivirus report

Notifications

Your email:
Friends email:
Download here
User rating
0/5
(0 votes)
Your opinion