Why Generate All Permutations of Array in DSA Typescript?

The Big Idea

What if you could instantly see every way to arrange your items without missing a single one?

The Scenario

Imagine you have a set of unique keys and you want to try every possible order to unlock a treasure chest. Writing down all possible orders by hand or guessing randomly would take forever and be very tiring.

The Problem

Trying to list all orders manually is slow and easy to mess up. You might forget some orders or repeat others. It's like trying to solve a big puzzle without a clear plan, which wastes time and causes frustration.

The Solution

Using a method to generate all permutations automatically lets the computer quickly and correctly list every possible order. This saves time, avoids mistakes, and helps solve problems that need checking all arrangements.

Before vs After

✗ Before

const arr = [1, 2, 3];
// Manually write all orders
const permutations = [
  [1,2,3], [1,3,2],
  [2,1,3], [2,3,1],
  [3,1,2], [3,2,1]
];

✓ After

function permute(arr: number[]): number[][] {
  if (arr.length === 0) return [[]];
  const result: number[][] = [];
  for (let i = 0; i < arr.length; i++) {
    const rest = [...arr.slice(0, i), ...arr.slice(i + 1)];
    for (const perm of permute(rest)) {
      result.push([arr[i], ...perm]);
    }
  }
  return result;
}

What It Enables

This lets you explore every possible order of items easily, which is key for solving puzzles, scheduling tasks, or testing combinations.

Real Life Example

When planning seating for a dinner party, you might want to try every seating order to find the best arrangement where everyone is happy.

Key Takeaways

Manual listing of all orders is slow and error-prone.

Generating permutations automatically saves time and avoids mistakes.

Permutations help solve problems needing all possible arrangements.