以下是選擇排序的僞代碼以及一些分析:
SELECTION-SORT(A) 執行次數
1 for j = 1 to Length(A) n
2 i = j n
3 key = A(i) n
4 for i to Lenth(A) n(n+1)/2
5 if key>A(i) ...
6 key = A(i) ...
7 k = i ...
8 A(k) = A(j) ...
9 A(j) = key ...
所以run time is O(n*n)