Insertion Index in Sorted Array

Introduction

In this lab, we will explore the fundamentals of JavaScript programming. Through a series of exercises and challenges, we will cover topics such as data types, variables, functions, and control flow. By the end of this lab, you will have a strong foundation in JavaScript programming and be equipped with the skills to tackle more advanced concepts. Get ready to dive into the exciting world of JavaScript!

Skills Graph

How to Find Insertion Index in Sorted Array

To find the lowest index at which a value should be inserted into a sorted array, follow these steps:

1. Check if the array is sorted in descending order.
2. Use Array.prototype.findIndex() method to find the appropriate index where the element should be inserted.

Here's the code to implement this:

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;
};

You can call the sortedIndex function by passing the sorted array and the value you want to insert. Here are some examples:

sortedIndex([5, 3, 2, 1], 4); // Output: 1
sortedIndex([30, 50], 40); // Output: 1

By using this function, you can easily find the insertion index of a value in a sorted array.

Summary

Congratulations! You have completed the Insertion Index in Sorted Array lab. You can practice more labs in LabEx to improve your skills.