程序员小灰算法图解

https://mp.weixin.qq.com/s/4kTtn_gLYQrX7JFlEJdsZg

https://mp.weixin.qq.com/s/oFQHrCZvItgc8McrZSaovw

https://mp.weixin.qq.com/s/Ok5SjqhiQkG5sLUPNY02Mw

#include <stdio.h>

int main(int argc,char *argv[]){

      char a[]="12NO34ghiQjk0a7yzABCDUVWXFbcdelmnopqrstuvwx5YZEK89fMP6GHIJRLST"

    int i,j,k,n

    for(n=i=0a[i]i++)//把数字删除

        if(!((a[n]=a[i])>='0' && a[n]<='9'))

            n++

    for(i=0i<ni++){//剩下的排序

        for(k=i,j=k+1j<nj++)

            if(a[k]>a[j])

                k=j

        if(k-i)

            j=a[k],a[k]=a[i],a[i]=j

    }

    a[i]='\0'

    printf("%s\n",a)

    return 0

}

---