[1] : The Free On-line Dictionary of Computing (27 SEP 03)

quicksort
     
        a sorting algorithm with on log n average time
        complexity.
     
        one element, x of the list to be sorted is chosen and the
        other elements are split into those elements less than x and
        those greater than or equal to x.  these two lists are then
        sorted recursively using the same algorithm until there is
        only one element in each list, at which point the sublists are
        recursively recombined in order yielding the sorted list.
     
        this can be written in haskell:
     
        	qsort               :: ord a => a -> a
        	qsort              = 
        	qsort x:xs         = qsort  u | u<-xs, u=x 
     
        mark jones, gofer prelude.
     
     
see also:
algorithm complexity recursive haskell 

Quicksort >> Q Words
Quicksort, definition of term: Quicksort
quicksort_pag1.html

Quicksort - Wikipedia, the free encyclopedia
...Randomized quicksort expected complexity. Randomized quicksort has the ... External links. *Interactive quicksort. *Multidimensional quicksort in ... ..
http://en.wikipedia.org/wiki/Quicksort, score=100, date indexed=February 3, 2006, 10:57 am

GameDev.net - Understanding the QuickSort Algorithm
...Well, they don’t call it a QuickSort for nothing. :) The QuickSort is ... So don’t be surprised if you try to QuickSort 20,000 integers and you ... ..
http://www.gamedev.net/reference/articles/article1073.asp, score=57, date indexed=November 17, 2005, 11:44 am

Chapter 13 Assignment - Simple Quicksort
...... NULL, 0) to make sure that it doesn't crash. * Calls quicksort to sort ... Header file for this version of the quicksort function. You don't have ... ..
http://www.cs.colorado.edu/~main/projects/chap13a.html, score=53, date indexed=January 5, 2006, 2:09 am

Lecture 5 - quicksort
...Quicksort(A,low, pivot-location - 1) Quicksort(A, pivot-location+1, ... Quicksort(A,1,n) Quicksort(A, low, high) if (low < high) pivot- ... ..
http://www.cs.sunysb.edu/~algorith/lectures-good/node5.html, score=51, date indexed=January 20, 2006, 8:35 am

Quicksort
...Quicksort. "Grundlagen der Programmierung". Folie 1 1. Geschichte und ... ..
http://www.quick-sort.de/, score=50, date indexed=December 29, 2005, 11:40 pm

Cprogramming.com - Sorting Algorithms - Quicksort
...That is why beginning programmers often overlook quicksort as a viable ... Quicksort's running time depends on the result of the partitioning ... ..
http://www.cprogramming.com/tutorial/computersciencetheory/quicksort.html, score=49, date indexed=November 14, 2005, 3:20 pm

12.7.4 Quicksort or Samplesort Algorithm
...So far, we have concentrated on standard quicksort. For quicksort to ... The classic quicksort algorithm is a divide-and-conquer sorting method ... ..
http://www.netlib.org/utk/lsi/pcwLSI/text/node302.html, score=44, date indexed=December 15, 2005, 10:09 pm

Quicksort
...recursion. if. (lo<j) quicksort(a, lo, j); if. (i<hi) quicksort(a, i, ... The following Java program implements Quicksort. void. quicksort (. ... ..
http://www.iti.fh-flensburg.de/lang/algorithmen/sortieren/quick/quicken.htm, score=43, date indexed=November 18, 2005, 1:26 am

Chapter 13 Assignment - Advanced Quicksort
...... quicksort function that is based on the quicksort function in the C++ ... Function In order to understand the flexible quicksort function, you ... ..
http://www.cs.colorado.edu/~main/projects/chap13b.html, score=41, date indexed=January 21, 2006, 6:20 pm

Page 1 2 Next