字符串长计算机百战小练

对字符串“OYTBAPIRAJYUEWWSWBJC”进行排序并输出。

int qk_s(const void *a,const void *b){
  return *(int*)a-*(int*)b;
}

char arr[30]=“OYTBAPIRAJYUEWWSWBJC”;
qsort(arr,len,sizeof(char),qk_s);

#include <stdio.h>
#include <string.h>

int main() {
    char str[] = "OYTBAPIRAJYUEWWSWBJC";
    int n = strlen(str);
    int i, j;

    for(i = 0; i < n - 1; i++) {
        for(j = 0; j < n - i - 1; j++) {
            if(str[j] > str[j+1]) {
                char temp = str[j];
                str[j] = str[j+1];
                str[j+1] = temp;
            }
        }
    }

    printf("%s\n", str);
    return 0;
}

• ```

/*对字符串“OYTBAPIRAJYUEWWSWBJC”进行排序并输出。*/
#include <stdio.h>
#include <string.h>
int main(){
    int i,length;
    char j;
    char op[]="OYTBAPIRAJYUEWWSWBJC";

    for(i=0;i<80;i++){
        if(op[i]=='\0'){
            length=i;
            
            break;
        }
    }
    
           for(j='A';j<='Z';j++){
                    for(i=0;i<length;i++){
                      if(op[i]==j){
                     printf("%c ",op[i]);
                 }
           }
        
    }

    
    
}

```