JavaScript: DHTML Insertion Sort

This page demonstrates the Insertion Sort algorithm.

id	colour	random
1	orange	357
2	orange	694
3	blue	605
4	blue	898
5	red	202
6	blue	618
7	green	990
8	yellow	425
9	yellow	182
10	blue	75
11	green	361
12	blue	66
13	orange	470
14	red	240
15	green	683
16	blue	659
17	yellow	204
18	blue	142
19	yellow	823
20	yellow	419

[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.

JavaScript DHTML Insertion Sort
JavaScript DHTML Sorting Using OOP
JavaScript DHTML Sorting Using OOP - Example 1
JavaScript DHTML Shell Sort
JavaScript DHTML Quick Sort
JavaScript DHTML Bubble Sort
PHP Sorting Arrays of Arrays
PHP Sorting SimpleXMLElement Object arrays

< JavaScript

Post your comment or question

JavaScript: DHTML Insertion Sort

JavaScript: DHTML Insertion Sort

How does it work?

Related Articles - Sorting Algorithms