Created
June 23, 2019 21:18
-
-
Save kalyco/5ef759c339fc9c9ddfc1636b9a63e0d4 to your computer and use it in GitHub Desktop.
Insertion Sort w JS
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
var insert = function(array, rightIndex, value) { | |
var i = 0; | |
for (var j = 1; array[j] < array[i]; j++) { | |
var tmp = array[i]; | |
array[i] = array[j]; | |
array[j] = tmp; | |
i++; | |
break; | |
} | |
for (i = rightIndex; value < array[i] && i >= 0; i--) { | |
var tmp = array[i]; | |
array[i] = value; | |
array[i+1] = tmp; | |
} | |
}; | |
var array = [3, 5, 7, 11, 13, 2, 9, 6]; | |
insert(array, 4, 2); | |
println("Array after inserting 2: " + array); | |
Program.assertEqual(array, [2, 3, 5, 7, 11, 13, 9, 6]); | |
insert(array, 5, 9); | |
println("Array after inserting 9: " + array); | |
Program.assertEqual(array, [2, 3, 5, 7, 9, 11, 13, 6]); | |
insert(array, 6, 6); | |
println("Array after inserting 6: " + array); | |
Program.assertEqual(array, [2, 3, 5, 6, 7, 9, 11, 13]); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment