Sandbox::https://github.com/prabaprakash/Hackerrank-JavaScript-Solutions/blob/master/insertionsort2.js

Repository navigation

53 lines (40 loc) · 1.1 KB

'use strict';

process.stdin.resume();

process.stdin.setEncoding('utf-8');

let inputString = '';

let currentLine = 0;

process.stdin.on('data', inputStdin => {

inputString += inputStdin;

});

process.stdin.on('end', _ => {

inputString = inputString.replace(/\s*$/, '')

.split('\n')

.map(str => str.replace(/\s*$/, ''));

main();

});

function readLine() {

return inputString[currentLine++];

}

// Complete the insertionSort2 function below.

function insertionSort2(n, arr) {

var i = 0, key = 0, j = 0;

for (i = 1; i < arr.length; i++) {

key = arr[i];

j = i - 1;

/* Move elements of arr[0..i-1], that are

greater than key, to one position ahead

of their current position */

while (j >= 0 && arr[j] > key) {

arr[j + 1] = arr[j];

j = j - 1;

}

arr[j + 1] = key;

console.log(arr.join(' '));

}

function main() {

const n = parseInt(readLine(), 10);

const arr = readLine().split(' ').map(arrTemp => parseInt(arrTemp, 10));

insertionSort2(n, arr);

}