AlgoFlow — Algorithms, Visualized

Sorting/Bubble Sort

comparisonin-placestable

Press play to start

1void bubbleSort(int* A, int n) {
  int i, j, tmp;
  for (i = 0; i < n; i++) {
      for (j = 0; j < n-1; j++) {
          if (A[j] > A[j+1]) {
              tmp = A[j];
              A[j] = A[j+1];
              A[j+1] = tmp;
          }
      }
  }
12}

Step 1/0

Practice

LeetCode·#912 Sort an ArrayMedium HackerRank·Bubble SortMedium NeetCode·Sort an ArrayMedium

BestO(n²)

AverageO(n²)

WorstO(n²)

SpaceO(1)