JavaScript: DHTML Quick Sort
This page demonstrates the Quick Sort algorithm. This is the most advanced algorithm of the four presented, but has some problems w.r.t. speed and the fact that it is not a 'stable' sort (see link at bottom of page for details).
To date we've found the Shell Sort algorithm to be more efficient with small-ish datasets - the kind of data displayed on websites.
Working Demonstration
| id | colour | random |
|---|---|---|
| 1 | red | 98 |
| 2 | red | 255 |
| 3 | orange | 274 |
| 4 | orange | 74 |
| 5 | green | 764 |
| 6 | yellow | 690 |
| 7 | red | 715 |
| 8 | red | 814 |
| 9 | red | 395 |
| 10 | red | 570 |
| 11 | red | 910 |
| 12 | yellow | 332 |
| 13 | red | 640 |
| 14 | purple | 233 |
| 15 | purple | 317 |
| 16 | yellow | 597 |
| 17 | red | 286 |
| 18 | purple | 393 |
| 19 | yellow | 992 |
| 20 | blue | 80 |
How does it work?
For a more detailed discussion on the sorting process, you can refer to the Bubble Sort page. The only difference between the two is the actual sorting algorithm, with the Quick Sort, in theory, being much faster:
/* global variables */
var col = 0;
var parent = null;
var items = new Array();
var N = 0;
var quicksort = function(m, n, desc) {
if(n <= m+1) return;
if((n - m) == 2) {
if(compare(get(n-1), get(m), desc)) exchange(n-1, m);
return;
}
i = m + 1;
j = n - 1;
if(compare(get(m), get(i), desc)) exchange(i, m);
if(compare(get(j), get(m), desc)) exchange(m, j);
if(compare(get(m), get(i), desc)) exchange(i, m);
pivot = get(m);
while(true) {
j--;
while(compare(pivot, get(j), desc)) j--;
i++;
while(compare(get(i), pivot, desc)) i++;
if(j <= i) break;
exchange(i, j);
}
exchange(m, j);
if((j-m) < (n-j)) {
quicksort(m, j, desc);
quicksort(j+1, n, desc);
} else {
quicksort(j+1, n, desc);
quicksort(m, j, desc);
}
};
var sortTable = function(tableid, n, desc) {
parent = document.getElementById(tableid);
col = n;
if(parent.nodeName == "TABLE") {
parent = parent.getElementsByTagName("TBODY")[0];
}
if(parent.nodeName != "TBODY") {
return false;
}
items = parent.getElementsByTagName("TR");
N = items.length;
/* quick sort */
quicksort(0, N, desc);
};
Th quick sort algorithm makes use of the get and compare functions presented previously in the Bubble Sort demonstration combined with the exchange function introduced in the Shell Sort demonstration for swapping non-adjacent elements.
All four methods (using OOP) are now available as external javascript files which you can find linked in the article DHTML Sorting Using OOP.
References
Related Articles - Sorting Algorithms
- JavaScript DHTML Quick Sort
- JavaScript DHTML Shell Sort
- JavaScript Sorting Algorithm Comparison
- JavaScript DHTML Insertion Sort
- JavaScript DHTML Bubble Sort
- JavaScript DHTML Sorting Using OOP - Example 1
- JavaScript DHTML Sorting Algorithms
- PHP Sorting Arrays of Arrays
- PHP Sorting SimpleXMLElement Object arrays