Why Heap Exists and What Sorted Array Cannot Do Efficiently in DSA Javascript - See It Work

Why Heap Exists and What Sorted Array Cannot Do Efficiently

📖 Scenario: Imagine you are managing a list of tasks with different priorities. You want to quickly find and remove the highest priority task. You first try using a sorted array but notice some operations are slow.

🎯 Goal: You will create a sorted array of task priorities, then try to add a new task and remove the highest priority task. This will show why heaps are useful compared to sorted arrays.

📋 What You'll Learn

Create a sorted array called tasks with exact values [10, 20, 30, 40, 50]

Create a variable called newTask with value 35

Insert newTask into tasks maintaining sorted order

Remove the highest priority task (largest number) from tasks

Print the final state of tasks after insertion and removal

💡 Why This Matters

🌍 Real World

Task scheduling systems need to quickly find and remove highest priority tasks. Using sorted arrays is slow for insertions.

💼 Career

Understanding why heaps are used helps in roles like software engineering, system design, and performance optimization.

1

Create a sorted array of tasks

Create a sorted array called tasks with these exact values: [10, 20, 30, 40, 50]

DSA Javascript

# Create the sorted array tasks with values [10, 20, 30, 40, 50]
// Your code here

Hint

Use const tasks = [10, 20, 30, 40, 50]; to create the array.

2

Add a new task priority

Create a variable called newTask with value 35

DSA Javascript

const tasks = [10, 20, 30, 40, 50];
// Create newTask with value 35
// Your code here

Hint

Use const newTask = 35; to create the variable.

3

Insert newTask into tasks maintaining sorted order

Insert newTask into tasks so that tasks remains sorted in ascending order. Use a for loop with variable i to find the correct position and use tasks.splice(i, 0, newTask) to insert.

DSA Javascript

const tasks = [10, 20, 30, 40, 50];
const newTask = 35;
// Insert newTask into tasks maintaining sorted order
// Your code here

Hint

Loop through tasks to find where newTask is smaller than tasks[i], then insert it there.

4

Remove highest priority task and print final tasks

Remove the highest priority task (largest number) from tasks using tasks.pop(). Then print the final state of tasks using console.log(tasks).

DSA Javascript

const tasks = [10, 20, 30, 40, 50];
const newTask = 35;
for (let i = 0; i < tasks.length; i++) {
    if (newTask < tasks[i]) {
        tasks.splice(i, 0, newTask);
        break;
    }
}
if (!tasks.includes(newTask)) {
    tasks.push(newTask);
}
// Remove highest priority task and print tasks
// Your code here

Hint

Use tasks.pop() to remove the largest task, then console.log(tasks) to print.