C simple sorting algorithm to change

Question

How to change the following sorting algorithm to operate on a single array arr[]? For now, I have to transfer elements from one array arr[] to res[]. How to preform all operations on arr[]? Here is my code:

void main(){
    
    int arr [] = {1, 14, 5, 18, 3, 1};
    int res [] = {0, 0, 0, 0, 0, 0};
    
    int x = 0;
    int y = 0;
    
    for(int i = 0; i < 6; i++) {
              x = 0;
          
        for(int k = 0; k < 6; k++){
                       
            if(arr[k] > x){
            x = arr[k];
            y = k;
            }
         }    
      arr[y] = 0;
      res[5 - i] = x;
    
    }
   
     for (int z = 0; z < 6; z++){
       printf("%d ", res[z]);
    }
 }

Are you trying to reverse-sort into `res`? You can always reverse sort by inverting your sort comparison. — tadman, Mar 19 '21 at 12:47
This is *mostly* a selection-sort, and there are *thousands* of examples online that demonstrate how that in-place algorithm works. — WhozCraig, Mar 19 '21 at 12:53
`main()` should `return` something upon exit. See 2nd answer https://stackoverflow.com/questions/204476/what-should-main-return-in-c-and-c. — alex01011, Mar 19 '21 at 13:12
@alex01011 The `main` function must be *declared* to return an `int`, but it doesn't actually have to explicitly contain a `return` statement. In the `main` function (but *only* in the `main` function) the compiler will add an implicit `return 0` of there's no explicit `return` statement. — Some programmer dude, Mar 19 '21 at 13:38
@Someprogrammerdude Sure I agree but is of type `void` in the posted code. — alex01011, Mar 19 '21 at 13:57

score 1 · Answer 1 · answered Mar 25 '21 at 05:09

Just swap the elements in array that mistakenly positioned thoroughly by checking one by one. This called as bubble sort. There's also another sorting algorithms u can search online or check visualgo for animated process for understanding.

void main(){
    
    int arr [] = {1, 14, 5, 18, 3, 1};    
    
    // This applies bubble sort
    for(int i = 0; i < 6; i++) {
        for(int k = 0; k < 6; k++){
            // Swap elements in an array  
            if(arr[i] > arr[k]){
                int x = arr[k];
                arr[k] = arr[i];
                arr[i] = x;
            }
         }        
    }
   
     for (int z = 0; z < 6; z++){
       printf("%d ", res[z]);
    }
 }

C simple sorting algorithm to change

1 Answers1