JavaScript function multiple calling

Question

Source code:

function CreateArray(length) {
    var array1 = [];
    for (var k = 0, t = length; k < t; k++) {
        array1.push(Math.round(Math.random() * 3000000))
    };
    return array1;
var array = CreateArray(100,500,1000) // works only for 100


console.time("insertionSort")

function insertionSort(array) {
    var countOuter = 0;
    var countInner = 0;
    var countSwap = 0;

    for(var i = 0; i < array.length; i++) {
        countOuter++;
        var temp = array[i];
        var j = i - 1;
        while (j >= 0 && array[j] > temp) {
            countInner++;
            countSwap++;
            array[j + 1] = array[j];
            j--;
        }
        array[j + 1] = temp;
    }

    console.log('outer:', countOuter, 'inner:', countInner, 'swap:', countSwap);
    return array;
}
console.timeEnd("insertionSort")

insertionSort(array.slice());

with this last calling I want to check 100,500,1000,5000 and other different lengths. Any ideas?

I want that the last calling will work for any lengths of arrays.

CertainPerformance · Accepted Answer · 2018-06-17 07:04:20Z

3

You need CreateArray to create multiple arrays at once, and then you need insertionSort to be able to process multiple arrays at once - or, even better, call another function (once) that calls insertionSort for each array:

const CreateArray = (...lengths) => lengths.map(length => (
  Array.from({ length }, () => Math.floor(Math.random() * 3000000))
));

function insertionSort(array) {
  var countOuter = 0;
  var countInner = 0;
  var countSwap = 0;
  for (var i = 0; i < array.length; i++) {
    countOuter++;
    var temp = array[i];
    var j = i - 1;
    while (j >= 0 && array[j] > temp) {
      countInner++;
      countSwap++;
      array[j + 1] = array[j];
      j--;
    }
    array[j + 1] = temp;
  }
  console.log('outer:', countOuter, 'inner:', countInner, 'swap:', countSwap);
}
const insertionSortMultipleArrays = (arrs) => {
  arrs.forEach(arr => {
    console.time("insertionSort");
    insertionSort(arr);
    console.timeEnd("insertionSort");
  });
};
  
const arrays = CreateArray(100,500,1000,5000);
insertionSortMultipleArrays(arrays);

answered Jun 17, 2018 at 7:04

CertainPerformance

373k55 gold badges354 silver badges359 bronze badges

Sign up to request clarification or add additional context in comments.

4 Comments

amrender singh Over a year ago

nice solution :-)

CertainPerformance Over a year ago

@rollback Being pretty functional, It looks very readable to me (except for the insertionSort part, which is nearly by definition a little bit convoluted), what were you thinking of?

rollback Over a year ago

ok, i understood a little bit, but what about already sorted array: function Sorted(a, b) { if (a > b) return 1; if (a < b) return -1; } var array8 = []; for (var k= 0, t=100; k<t; k++){ array8.push(Math.round(Math.random() * 3000000)) }; array8.sort(Sorted); how to add this array with the any lenght(100,500,1000) to this algorithm?

CertainPerformance Over a year ago

Same way insertionSort was turned into insertionSortMultipleArrays - have another function call it multiple times (or turn your sort function into one that iterates over and sorts multiple arrays, rather than just a single one)

Collectives™ on Stack Overflow

JavaScript function multiple calling

1 Answer 1

4 Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

4 Comments

Your Answer

Sign up or log in

Post as a guest

Related