常见几种排序
冒泡排序:

struct Array { int * pBase; int length; int current; }; void sort_array(struct Array * pArray) { int i, j, t; for (i = 0; i < pArray->current; i++) { for (j = i+1; j < pArray->current; j++) { if (pArray->pBase[i] > pArray->pBase[j]) { t = pArray->pBase[i]; pArray->pBase[i] = pArray->pBase[j]; pArray->pBase[j] = t; } } } }View Code
SRE实战 互联网时代守护先锋,助力企业售后服务体系运筹帷幄!一键直达领取阿里云限量特价优惠。

更多精彩