Master the art of using Insertion Sort in javascript with the help of Khan Academy

Question

Master the art of using Insertion Sort in javascript with the help of Khan Academy

Seems like I am almost there with solving this problem, but my code isn't running as expected. Can someone offer some feedback and point out where I went wrong?

var insert = function(array, rightIndex, value) {
    for(var j = rightIndex;
        j >= 0 && array[j] > value;
        j--) {
        array[j + 1] = array[j];
    }   
    array[j + 1] = value; 
};

var insertionSort = function(array) {
    for(var i = 1; i < array.length; i++){
        insert(array, array.length -1, i);
    }
};

var array = [22, 11, 99, 88, 9, 7, 42];
insertionSort(array);
println("Array after sorting:  " + array);
//Program.assertEqual(array, [7, 9, 11, 22, 42, 88, 99]);

When I use insert(array, array[i], i);, the output is:

Array after sorting: 22,11,12,100,89,10,8,43,5,,4,,1,,

javascript algorithm

Answer 1

Answer №1

Here is another approach to solving the insertion sort problem:


const insertValue = function(arr, index, val) {
    for(let j = index; j >= 0 && arr[j] > val; j--) {
        arr[j + 1] = arr[j];
    }
    arr[j + 1] = val;
};

const performInsertionSort = function(arr) {
    for(let i = 0; i < arr.length-1; i++){
        insertValue(arr, i, arr[i+1]);
    }
};

let numArray = [34, 56, 22, 78, 90, 10];
performInsertionSort(numArray);

Answer 2

Here is another approach to solving the insertion sort problem:


const insertValue = function(arr, index, val) {
    for(let j = index; j >= 0 && arr[j] > val; j--) {
        arr[j + 1] = arr[j];
    }
    arr[j + 1] = val;
};

const performInsertionSort = function(arr) {
    for(let i = 0; i < arr.length-1; i++){
        insertValue(arr, i, arr[i+1]);
    }
};

let numArray = [34, 56, 22, 78, 90, 10];
performInsertionSort(numArray);

Answer 3

Answer №2

It appears there is an issue that needs addressing:

Within the line

insert(array, array.length -1, i);

, it should actually be

insert(array, array.length -1, array[i]);

The mistake made was inserting the array index instead of the value

Additionally, a potential array out-of-bounds error exists in array[j + 1] = array[j]; since j starts from array.length -1. It would be more appropriate to use array[j] = array[j-1]; while ensuring j>0.

One final point: The rightIndex variable should be i for each iteration, not array.length -1.

Updated code snippet :

var insert = function(array, rightIndex, value) {
        for(var j = rightIndex;
                j > 0 && array[j-1] > value;
                j--) {
                array[j] = array[j-1];
            }   
            array[j] = value; 
        };

        var insertionSort = function(array) {
            for(var i = 0; i < array.length; i++){
                insert(array, i, array[i]);
            }

        };

        var array = [22, 11, 99, 88, 9, 7, 42];
        insertionSort(array);

Answer 4

It appears there is an issue that needs addressing:

Within the line

insert(array, array.length -1, i);

, it should actually be

insert(array, array.length -1, array[i]);

The mistake made was inserting the array index instead of the value

Additionally, a potential array out-of-bounds error exists in array[j + 1] = array[j]; since j starts from array.length -1. It would be more appropriate to use array[j] = array[j-1]; while ensuring j>0.

One final point: The rightIndex variable should be i for each iteration, not array.length -1.

Updated code snippet :

var insert = function(array, rightIndex, value) {
        for(var j = rightIndex;
                j > 0 && array[j-1] > value;
                j--) {
                array[j] = array[j-1];
            }   
            array[j] = value; 
        };

        var insertionSort = function(array) {
            for(var i = 0; i < array.length; i++){
                insert(array, i, array[i]);
            }

        };

        var array = [22, 11, 99, 88, 9, 7, 42];
        insertionSort(array);

Answer 5

Answer №3

Insertion sort is a sorting algorithm that involves dividing the initial unsorted array into two parts: the sorted part and the unsorted part. At first, the sorted part consists of just one element (an array with only one element is considered sorted). Elements are then selected one by one from the unsorted part and inserted into the correct position in the sorted part, gradually expanding the sorted part as each element is inserted.

var numbers = [34, 203, 3, 746, 200, 984, 198, 764, 9];

function insertionSort(arr) {
  var len = arr.length;
  for(var i = 1; i < len; ++i) {
    var tmp = arr[i];
    var j = i - 1;
    for(; j >= 0 && arr[j] > tmp; --j) {
      arr[j+1] = arr[j];
    }
    arr[j+1] = tmp;
  }
};

console.log(numbers);
insertionSort(numbers);
console.log(numbers);

Answer 6

Insertion sort is a sorting algorithm that involves dividing the initial unsorted array into two parts: the sorted part and the unsorted part. At first, the sorted part consists of just one element (an array with only one element is considered sorted). Elements are then selected one by one from the unsorted part and inserted into the correct position in the sorted part, gradually expanding the sorted part as each element is inserted.

var numbers = [34, 203, 3, 746, 200, 984, 198, 764, 9];

function insertionSort(arr) {
  var len = arr.length;
  for(var i = 1; i < len; ++i) {
    var tmp = arr[i];
    var j = i - 1;
    for(; j >= 0 && arr[j] > tmp; --j) {
      arr[j+1] = arr[j];
    }
    arr[j+1] = tmp;
  }
};

console.log(numbers);
insertionSort(numbers);
console.log(numbers);

Answer 7

Answer №4

Arriving a bit fashionably late to the event, it seems there are numerous methods to tackle this challenge, yet the golden figure on KA prefers a specific approach. Here is the solution that brought a smile to its face:

function insertValue(array, rightIdx, val) {
 for(let i=rightIdx; i >= 0 && array[i] > val ; i--){
    array[i+1] = array[i];
 }
 array[i+1] = val;
};

Answer 8

Arriving a bit fashionably late to the event, it seems there are numerous methods to tackle this challenge, yet the golden figure on KA prefers a specific approach. Here is the solution that brought a smile to its face:

function insertValue(array, rightIdx, val) {
 for(let i=rightIdx; i >= 0 && array[i] > val ; i--){
    array[i+1] = array[i];
 }
 array[i+1] = val;
};

Master the art of using Insertion Sort in javascript with the help of Khan Academy

Answer №1

Answer №2

Answer №3

Answer №4

Similar questions

What is the process for applying a border to the chosen image within the ImageList of the MaterialUI component?

What steps can be taken to resolve the error message "t.onSubmit is not a function" that occurs upon form submission?

Using the ES6 filter method to iterate through a double nested array of objects

Solutions for Showing Pop-up Tabs in React Native Webview

concealing the upper header while scrolling and shifting the primary header upwards

Employing aspect.around while actively monitoring for methods invoking one another

the attempt to send an array of data to the $.ajax function was unsuccessful

Utilizing jQuery and ajax to invoke an MVC controller

Navigating Users and Routing with Ionic Framework (AngularJS)

Create a soft focus on the background sans any filters

Resolving TypeError: matchesSelector method is not recognized within React component

Disabling a checkbox within an onClick event handler

Issue alert before running tests on component that includes a Material UI Tooltip

Effortlessly Display or Conceal Numerous Table Columns Using jQuery

Stop the webpage from scrolling when clicking on a ui-grid field

Utilizing a jQuery AJAX request to invoke a web method within a

Send a parameter to an Angular directive when clicked

Custom positioning of Mui Snackbar in V5

What method can be used to incorporate expressions into Handlebars partials when dealing with parameters?

Incorporating React components into your current Django project