摘要: 1.快速排序 int Partition ( SqList L,int low, int high ){ L.elem[0]=L.elem[low]; int l=low,r=high; while(l<r){ while(r>l&&L.elem[r]>=L.elem[0]) r--; L.elem 阅读全文
posted @ 2024-12-20 15:08 茆伟昊 阅读(12) 评论(0) 推荐(0)