JavaScriptExercises/sort2.js at master · marshmeryl/JavaScriptExercises · GitHub

37 lines (32 loc) · 746 Bytes

function sort2(numArray) {

var copiedArray = numArray.slice();

var result = [];

if (copiedArray.length === 0) {

return [];

}

var min;

var index;

while (copiedArray.length > 0) {

min = Math.min.apply(Math, copiedArray);

index = copiedArray.indexOf(min);

copiedArray.splice(index,1);

result.push(min);

}

return result;

}

var testCase = [

[1, 3, -2, 5, 100, -2],

[6, 5, 4, 3, 1, 0, -10, -21],

[0, 1, 2, 3 ,4 ,5, 6, 7],

[1000, 1, 2000, 2, 3000, 3],

[9999, 9, 8888, 8, 7777, 7],

[],

[1, 2],

[1, 0],

[1, 1, 1, 1, 1, 10, 1, 1, 1, 1],

[1, 1, 1, 1, 1, -10, 1, 1, 1, 1]

];

for (var i = 0; i < testCase.length; i++) {

console.log("Before sort: " + testCase[i] );

console.log("After sort: " + sort2(testCase[i]) + "\n");

}

Expand file tree