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

Bubble Sort

Bubble sort repeatedly compares adjacent values and swaps out-of-order pairs, causing large values to 'bubble' toward the end.

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

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

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

Bubble sort repeatedly compares adjacent values and swaps out-of-order pairs, causing large values to 'bubble' toward the end.

شرح مبسط

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

After one full pass, the largest unsorted value is in its final position.

With an early-exit flag, an already sorted array can finish in O(n).

التنفيذ

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

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 Bubble Sort, the goal is to make the invariant visible rather than to memorize code.

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

function bubbleSort(input) {
  const a = [...input];
  for (let end = a.length - 1; end > 0; end--) {
    let swapped = false;
    for (let i = 0; i < end; i++) {
      if (a[i] > a[i + 1]) {
        [a[i], a[i + 1]] = [a[i + 1], a[i]];
        swapped = true;
      }
    }
    if (!swapped) break;
  }
  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.

أخطاء شائعة

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

Forgetting the shrinking end boundary.
Using it for large real workloads where O(n²) is too expensive.

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

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

Use it mainly to demonstrate sorting fundamentals, stability and best/average/worst-case reasoning rather than as a production default.

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

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

What problem does Bubble Sort solve?

Bubble sort repeatedly compares adjacent values and swaps out-of-order pairs, causing large values to 'bubble' toward the end.

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

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

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

Forgetting the shrinking end boundary.

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

function bubbleSort(input) { const a = [...input]; for (let end = a.length - 1; end > 0; end--) { let swapped = false; for (let i = 0; i < end; i++) { if (a[i] > a[i + 1]) { [a[i], a[i + 1]] = [a[i + 1], a[i]]; swapped = true; } } if (!swapped) break; } return a; }