JavaScript Sorting Algorithm: Sorted Index
JavaScript Sorting Algorithm: Exercise-22 with Solution
Write a JavaScript program to find the lowest index at which a value should be inserted into an array to maintain its sorting order.
- Loosely check if the array is sorted in descending order.
- Use Array.prototype.findIndex() to find the appropriate index where the element should be inserted.
Sample Solution:
JavaScript Code:
const sortedIndex = (arr, n) => {
const isDescending = arr[0] > arr[arr.length - 1];
const index = arr.findIndex(el => (isDescending ? n >= el : n <= el));
return index === -1 ? arr.length : index;
};
console.log(sortedIndex([5, 3, 2, 1], 4));
console.log(sortedIndex([30, 50], 40));
Sample Output:
1 1
Flowchart:

Live Demo:
See the Pen javascript-common-editor by w3resource (@w3resource) on CodePen.
Improve this sample solution and post your code through Disqus
Previous: Write a JavaScript program to Finds the index of a given element in a sorted array using the binary search algorithm.
Next: Write a JavaScript program to find the highest index at which a value should be inserted into an array in order to maintain its sort order.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
- Weekly Trends
- Python Interview Questions and Answers: Comprehensive Guide
- Scala Exercises, Practice, Solution
- Kotlin Exercises practice with solution
- MongoDB Exercises, Practice, Solution
- SQL Exercises, Practice, Solution - JOINS
- Java Basic Programming Exercises
- SQL Subqueries
- Adventureworks Database Exercises
- C# Sharp Basic Exercises
- SQL COUNT() with distinct
- JavaScript String Exercises
- JavaScript HTML Form Validation
- Java Collection Exercises
- SQL COUNT() function
- SQL Inner Join