알고리즘 읽기 노트

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