AlgoFlow — Algorithms, Visualized

Sorting/Selection Sort

comparisonin-placeunstable

Press play to start

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

Step 1/0

Practice

LeetCode·#912 Sort an ArrayMedium Beecrowd·#1025 Where is the Marble?Easy

BestO(n²)

AverageO(n²)

WorstO(n²)

SpaceO(1)