procedure quick(l,r:longint);//快排是二分的经典应用varx,y,i,j:longint;beginx:=c[(l+r) div 2];i:=l;j:=r;//c数组为要排序的数组repeatwhile c>x do inc(i);//保证a均大于a[x];while c[j]<x ...
冒泡:从大到小:var i,j,n,t:longint;
a:array[1..100000]of longint;begin read(n); for i:=1 to n do read(a); for i:=1 to n-1 dofor j:=i+1 to n doif a<a[j] then...