sort

QuickSortion

best:o(nlogn) evrytime half
wrost:o(n2) line
average:o(nlogn);
stable:false (6,1(A),1(B),5) -> (1(B),1(A),5,6)
space:o(1)

SelectSorting

all:o(n2)
stable:true
space:o(1)

InsertionSort

wrost:n2;
best:n;
average:n2;
stable:true;