Interactive Lab

Sorting Algorithm Visualizer

Explore how classic sorting algorithms behave step-by-step, and compare their formulas and Big-O complexity.

AlgorithmArray Size: 26Speed: 120ms

10

28

38

25

55

20

85

18

48

42

89

31

29

50

21

32

12

87

17

47

99

72

96

97

20

56

Repeatedly compares neighboring values and swaps them until the largest values bubble to the end.

Comparisons: Σ(i=1→n-1) i = n(n-1)/2

for i = 0 to n - 2
  for j = 0 to n - 2 - i
    if A[j] > A[j + 1]
      swap(A[j], A[j + 1])

Best: O(n)

Average: O(n²)

Worst: O(n²)

Space: O(1)

Steps: Press Start to run.

SQL Demo (Read-Only)

OCI Autonomous Database GET Demo

Queries are hardcoded on the backend for safety. The frontend only chooses a predefined query id.

Sample Query