JavaScript: DHTML Insertion Sort
JavaScript: DHTML Insertion Sort
This page demonstrates the Insertion Sort algorithm.
| id | colour | random |
|---|---|---|
| 1 | green | 635 |
| 2 | orange | 264 |
| 3 | purple | 226 |
| 4 | yellow | 550 |
| 5 | purple | 828 |
| 6 | red | 949 |
| 7 | red | 873 |
| 8 | green | 822 |
| 9 | red | 854 |
| 10 | blue | 569 |
| 11 | orange | 969 |
| 12 | purple | 518 |
| 13 | red | 102 |
| 14 | orange | 921 |
| 15 | orange | 77 |
| 16 | purple | 899 |
| 17 | orange | 2 |
| 18 | red | 319 |
| 19 | yellow | 134 |
| 20 | blue | 805 |
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 Insertion Sort, in theory, being a little bit faster:
// global variables
var parent = null; // 'parent' node
var items = new Array(); // array of 'child' nodes
var col = 0; // column for sorting
function sortTable(tableid, n, desc)
{
parent = document.getElementById(tableid);
col = n;
if(parent.nodeName != "TBODY")
parent = parent.getElementsByTagName("TBODY")[0];
if(parent.nodeName != "TBODY")
return false;
// assert: parent is now a TBODY node
items = parent.getElementsByTagName("TR");
var N = items.length;
// insertion sort
for(var j=1; j < N; j++) {
for(var i=j; i > 0 && compare(get(i), get(i-1), desc); i--) {
exchange(i, i-1);
}
}
}
For more advanced (and complicated) sorting techniques, see the Shell Sort and Quick Sort demonstrations.
Related Articles - Sorting Algorithms
- DHTML Shell Sort [JAVASCRIPT]
- DHTML Bubble Sort [JAVASCRIPT]
- DHTML Sorting Using OOP [JAVASCRIPT]
- DHTML Quick Sort [JAVASCRIPT]
- DHTML Sorting Using OOP - Example 1 [JAVASCRIPT]
- DHTML Insertion Sort [JAVASCRIPT]
- Sorting Arrays of Arrays [PHP]
- Sorting SimpleXMLElement Object arrays [PHP]
Send a message to The Art of Web:
press <Esc> or click outside this box to close