Sorting

Bubble Sort

Repeatedly walk the vector comparing adjacent pairs and swapping any that are out of order. After pass k, the k largest elements are in their final positions at the end. Stop early when a full pass makes zero swaps.

Algorithm

Canonical input c(5, 1, 4, 2, 8) finishes after three passes: two with swaps, then a clean pass that triggers the early exit. Final vector c(1, 2, 4, 5, 8).

Basic Implementation

basic.R 
arr <- c(5, 1, 4, 2, 8)
n <- length(arr)
i <- 1
done <- FALSE
while (i <= n - 1 && !done) {
	swapped <- FALSE
	j <- 1
	while (j <= n - i) {
		if (arr[j] > arr[j + 1]) {
			tmp <- arr[j]
			arr[j] <- arr[j + 1]
			arr[j + 1] <- tmp
			swapped <- TRUE
		}
		j <- j + 1
	}
	if (!swapped) {
		done <- TRUE
	}
	i <- i + 1
}
cat("[", paste(arr, collapse = ", "), "]\n", sep = "")

Complexity

  • Time: O(n^2) worst and average; O(n) best (already sorted with early exit)
  • Space: O(1)
  • Stable: yes

Implementation notes

  • R: explicit while loops with i, j, done, and swapped so the early-exit flow stays visible. The stdlib sort(arr) is implemented in C and would hide the comparison-and-swap the lesson is teaching, and order(arr) only returns indices — neither shows the moving pivot value the lesson highlights.
  • The explicit tmp <- arr[j]; arr[j] <- arr[j+1]; arr[j+1] <- tmp three-line swap keeps the move visible without leaning on R's vectorised swap arr[c(j, j+1)] <- arr[c(j+1, j)].
  • The replay distinguishes compare frames from swap frames so the moving pivot value is visible. The pass number and swapped flag appear in the trace.
adjacent-pair compare and swap Inner loop walks `j` from `1` to `n - i` comparing `arr[j]` and `arr[j + 1]`.
early exit A `swapped` flag set `FALSE` at the start of each pass. If no swap happened, flip a `done` flag and break out of the outer loop.