How to use the Insertion Sort Algorithm In Javascript
In this approach, we use the insertion sort algorithm to iterate through each row of the array. Here we apply Insertion Sort to each row, which iteratively places each element in its correct position within the sorted subarray to its left. Continue this process until the entire row is sorted. Repeat this process for each row in the 2D array.
Example: Implementation of Sort the 2D Array Across Rows using the Insertion Sort Algorithm
// Function to sort a 2D array
// across rows using Insertion Sort
function sort2DArrayAcrossRows(arr) {
// Iterate through each row of the array
for (let i = 0; i < arr.length; i++) {
// Apply Insertion Sort to the current row
for (let j = 1; j < arr[i].length; j++) {
let current = arr[i][j];
let k = j - 1;
while (k >= 0 && arr[i][k] > current) {
arr[i][k + 1] = arr[i][k];
k--;
}
arr[i][k + 1] = current;
}
}
return arr;
}
// Example usage:
const array2D = [
[4, 2, 6, 1],
[9, 5, 3, 8],
[7, 1, 2, 0]
];
const sortedArray = sort2DArrayAcrossRows(array2D);
console.log(sortedArray);
Output
[ [ 1, 2, 4, 6 ], [ 3, 5, 8, 9 ], [ 0, 1, 2, 7 ] ]
JavaScript Program to Sort the 2D Array Across Rows
We will see how to sort the 2D Array across rows using a Javascript program. we can sort the 2D Array Across Rows in many ways including Bubble Sort Algorithm, Array.prototype.sort() method, Insertion Sort Algorithm, Using the Selection Sort Algorithm, and Merge Sort Algorithm.
Example:
Input:
[[8 5 7 2],
[7 3 0 1],
[8 5 3 2],
[9 4 2 1]]
Output:
[[2, 5, 7, 8], [0, 1, 3, 7], [2, 3, 5, 8], [1, 2, 4, 9]]
These are the following approaches:
Table of Content
- Using the Bubble Sort Algorithm
- Using the Array.prototype.sort() method
- Using the Insertion Sort Algorithm
- Using the Selection Sort Algorithm
- Using the Merge Sort Algorithm