ملاحظة قراءة الخوارزمية

Insertion Sort

Insertion sort grows a sorted prefix. It takes the next value and shifts larger values right until the new value can be inserted in the correct place.

النوعخوارزميةالفئةSortingالعمقمبتدئالتعقيد المعتادO(n²)

إجابة مقابلة قصيرة

ابدأ بهذا النموذج الذهني

Insertion sort grows a sorted prefix. It takes the next value and shifts larger values right until the new value can be inserted in the correct place.

شرح مبسط

كيف يعمل، بلا مصطلحات زائدة

It behaves like sorting playing cards in your hand.

It is O(n²) generally, but performs well on small or nearly sorted input and is stable.

التنفيذ

اقرأ الخوارزمية كسلسلة من القرارات

Understand what one pass/partition/merge guarantees.

Track which region is already finalized.

Reason about comparisons, swaps/moves and extra memory.

مثال صغير لتحتفظ به في ذهنك

Read a tiny input by hand and write down the state after every important operation. For Insertion Sort, the goal is to make the invariant visible rather than to memorize code.

تطبيق JavaScript قابل للقراءةJavaScript

function insertionSort(input) {
  const a = [...input];
  for (let i = 1; i < a.length; i++) {
    const value = a[i];
    let j = i - 1;
    while (j >= 0 && a[j] > value) {
      a[j + 1] = a[j];
      j--;
    }
    a[j + 1] = value;
  }
  return a;
}

كيف تقرأ هذا الكود

لا تحفظ الصياغة. تتبع الحالة التي تتغير في كل سطر واربطها بالثابت الموضح أعلاه.

التعقيد

O(n²)

Do not quote this complexity mechanically. Ask which operation or input dimension it describes, then derive the cost from the loops, recursion depth, data-structure operations and any preprocessing assumptions.

متى تستخدمه

مناسب لـ

Choose based on input size, order, key range, stability and memory limits.

أخطاء شائعة

ما الذي يسوء عادةً

Comparing only average Big-O.
Forgetting stability, in-place behavior, recursion depth or key-domain assumptions.

كيف تشرحه في المقابلة

صيغة إجابة احترافية

Mention adaptive behavior on nearly sorted data and why insertion sort is often used for small partitions inside hybrid sort implementations.

المشكلة→الفكرة الأساسية→الثابت / الحالة→Big-O→المفاضلة

فحص سريع للمقابلة

What problem does Insertion Sort solve?

Insertion sort grows a sorted prefix. It takes the next value and shifts larger values right until the new value can be inserted in the correct place.

ماذا يجب أن أذكر عن التعقيد؟

Its typical cost here is O(n²), but a complete answer should connect that cost to the representation, input constraints and the dominant operations.

ما الخطأ الأكثر شيوعاً؟

Comparing only average Big-O.

متابعة القراءةStable sortingIn-place sortingDivide and conquer

function insertionSort(input) { const a = [...input]; for (let i = 1; i < a.length; i++) { const value = a[i]; let j = i - 1; while (j >= 0 && a[j] > value) { a[j + 1] = a[j]; j--; } a[j + 1] = value; } return a; }