摘要:
void quicksort(int *arry,int low, int high){ int i=low; int j=high; int base=arry[low]; if(low >= high) return; while(low <high) { while(low < high && 阅读全文
摘要:
void puthex(unsigned int val){ /*0x123abcd*/ int i; int j; printf("0x"); for(i=0;i<8;i++) { j = (val >> (7-i)*4) & 0xf; //从高到低每四位二进制 if((j <= 9) && (j 阅读全文