The code below sorts an array in numerical descending order. Insert a section of

Question

The code below sorts an array in numerical descending order. Insert a section of code that prints out the array in ascending order below the original.

ZZZZZZZZZZZZZZZZZZZZZZZZZZ

#include <stdio.h>
int main (void){

int set[10] = {12, 5, 7, 6, 2, 18, 5, 2, 9, 3};

int i;
int j;
int swap;

// Bubble Sort, order output //

for (i = 0;i < 9; i++){
for (j =0;j < 9;j++){
  
if (set[j] < set [j+1]){
swap= set[j];
set [j] = set[j+1];
set [j+1] = swap;
  
}
}
}

int k;
for (k = 0; k < 9; k++){
printf("%d, ",set[k] );
}
return 0;

}

Explanation / Answer

include <stdio.h>
int main (void){

   int set[10] = {12, 5, 7, 6, 2, 18, 5, 2, 9, 3};

   int i;
   int j;
   int swap;

   // Bubble Sort, order output //

   for (i = 0;i < 9; i++){
       for (j =0;j < 9;j++){
      
           if (set[j] < set [j+1]){
               swap= set[j];
               set [j] = set[j+1];
               set [j+1] = swap;
           }
       }
   }

   int k;
   for (k = 0; k < 9; k++){
       printf("%d, ",set[k] );
   }

   // Bubble Sort, Ascending order output //  

   for (i = 0;i < 9; i++){
       for (j =0;j < 9;j++){
      
           if (set[j] > set [j+1]){
               swap= set[j];
               set [j] = set[j+1];
               set [j+1] = swap;
           }
       }
   }

   int h;
   for (h = 0; h < 9; h++){
       printf("%d, ",set[h] );
   }

   return 0;
}

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.