JavaScript Sorting Algorithm: Sorted IndexBy

JavaScript Sorting Algorithm: Exercise-20 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. This is based on the provided iterator function.

  • 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, based on the iterator function fn.

Sample Solution:

JavaScript Code:

const sortedIndexBy = (arr, n, fn) => {
  const isDescending = fn(arr[0]) > fn(arr[arr.length - 1]);
  const val = fn(n);
  const index = arr.findIndex(el =>
    isDescending ? val >= fn(el) : val <= fn(el)
  return index === -1 ? arr.length : index;

console.log(sortedIndexBy([{ x: 4 }, { x: 5 }], { x: 4 }, o => o.x));

Sample Output:



JavaScript Searching and Sorting Algorithm Exercises: Sorted IndexBy.

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 sort the characters in a string alphabetically.
Next: Write a JavaScript program to Finds the index of a given element in a sorted array using the binary search algorithm.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.

Follow us on Facebook and Twitter for latest update.