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... Platforms: Windows, XP, Windows Vista

It uses recursion to to implement quicksort. For the purpose of partitioning pivot is chosen according to median-of-three scheme. Platforms: Matlab

Quicksort is a standard algorithm for sorting in Computer science. I dont consider it to be highly optimized but can be used for educational purpose. Platforms: Matlab

RadixSort is faster than both HeapSort and QuickSort. It sorts using a comparision routine you provide to compare two elements to be sorted plus a method to extract individual bytes from the keys to be sorted. The time to sort each item unlike most sorts, does not increase with larger sorts. It... Platforms: Windows, XP, Windows Vista

PDL::GSL::INTERP is a PDL interface to Interpolation routines in GSL. SYNOPSIS use PDL; use PDL::GSL::INTERP; my $x = sequence(10); my $y = exp($x); my $spl = PDL::GSL::INTERP->init(cspline,$x,$y); my $res = $spl->eval(4.35); $res = $spl->deriv(4.35); $res = $spl->deriv2(4.35);... Platforms: *nix

Algorithm::Networksort can create inline comparisons for sorting. SYNOPSIS use Algorithm::Networksort qw(:all); my $inputs = 4; # # Generate the network (a list of comparators). # my @network = nw_comparators($inputs); # # Print the list, and print the graph of the list. # print... Platforms: *nix

CrissCross is a small cross-platform C++ library for threading, console and file I/O, CPU identification (CPUID), and sockets (TCP and UDP). The main goal is to provide the ability to write a program using identical calls on the major platforms (Windows, Linux, FreeBSD, OpenBSD, NetBSD, and Mac... Platforms: *nix