building menu...

JavaScript: DHTML Insertion Sort

This page demonstrates the Insertion Sort algorithm.

id	colour	random
1	green	70
2	green	617
3	blue	887
4	purple	211
5	green	174
6	green	365
7	yellow	499
8	red	32
9	green	903
10	red	563
11	green	615
12	red	288
13	yellow	821
14	green	973
15	purple	869
16	green	906
17	orange	102
18	purple	717
19	orange	288
20	orange	355

[add rows to TABLE]

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.

Other Sorting Algorithms

Advanced Code

DHTML Sorting Using OOP

[Back to JavaScript]

JavaScript: DHTML Insertion Sort

How does it work?

Related Articles

Other Sorting Algorithms

Advanced Code

Send Feedback