{"id":308,"date":"2011-03-07T13:14:23","date_gmt":"2011-03-07T19:14:23","guid":{"rendered":"http:\/\/bateru.com\/news\/?p=308"},"modified":"2012-11-05T12:59:06","modified_gmt":"2012-11-05T18:59:06","slug":"code-of-the-day-javascript-insertion-sort","status":"publish","type":"post","link":"https:\/\/bateru.com\/news\/2011\/03\/code-of-the-day-javascript-insertion-sort\/","title":{"rendered":"Code of the day – Javascript Insertion Sort"},"content":{"rendered":"

Insertion Sort. <\/b>
\nBest: O(n), Average: O(n2<\/sup>), Worst: O(n2<\/sup>)
\nInsertion sort is a simple sorting algorithm, a comparison sort in which the sorted array (or list) is built one entry at a time.
\nVisit Wikipedia<\/a> for more information.<\/p>\n

Code<\/h2>\n
\r\n\/\/Programmer: Larry Battle Mar 9, 2011\r\n\/\/Purpose: Insertion sort implemented in Javascript.\r\nvar insertionSort = function (arr) {\r\n    var len = arr.length, i = -1, j, tmp;\r\n\r\n    while (len--) {\r\n        tmp = arr[++i];\r\n        j = i;\r\n        while (j-- && arr[j] > tmp) {\r\n            arr[j + 1] = arr[j];\r\n        }\r\n        arr[j + 1] = tmp;\r\n    }\r\n};\r\n<\/pre>\n
Usage<\/h2>\n
\r\ninsertionSort( [5,4,3,2,1] ); \/\/returns [1,2,3,4,5];\r\ninsertionSort( [ \"bear\", \"dog\", \"cat\" ] ) \/\/ returns [\"bear\", \"cat\", \"dog\"];\r\n<\/pre>\n
Demo<\/h2>\n
Jsbin.com<\/a>
\nbateru.com\/uploads<\/a><\/p>\n
Here’s a great short video tutorial to help those clueless about insertion sort.
\n