[Exercise 16] Arrays: Bubble-sort

0 like 0 dislike
8.5k views

Please write a program that receives 5 numbers in an array, then makes those numbers in ascending order by using bubble-sort.

**Use the template given below**

Code (Template)

#include <stdio.h>

int main(){
	int number[5]; // Do not change
	int size = 5, temporary; // Do not change
	
	for(int i=0;i<size;i++){ // Do not change
		scanf("%d",&number[i]); // Do not change
	} // Do not change

	// Your conditions start from here

	return 0;
}

 

Input 1

77 22 88 11 22

Output 1

11 22 22 77 88

 

Input 2

34 32 12 64 2

Output 2

2 12 32 34 64
[Exercise] Coding (C) - asked in Chapter 4: Arrays by (5.9k points)
ID: 37580 - Available when: Unlimited - Due to: Unlimited | 8.5k views

46 Answers

0 like 0 dislike 
Hidden content!
#include * * ** ** *

int main(){
 ** *    number[5]; // Do not change
 **  ****  size = 5, ** * *** // Do not change

  *  * * *    **  ** **  ***  // Do not change
*  ** *  *    **  *   *     *  *   *  ** *** *  *  // Do not change
*** *  *   // Do not change

 ****   *  * ** *   * * *   {
*         * ***  *** *  *      
** * *   * ***   *** * * *  ***  ***** ** {
*    **  **   ** * * *  * *  **** **    
  *** **** ***   **  * *******  *   ** * *
 *** *  * ********* **** ****  *      *   *
*** *   **   **
    **  *
 * ***   
 ** * ****          **  {
*  * *** *    **** *   ***  *    *   *****   *  * * ********
    *******

    ****      0;
}
100/100 answered by (273 points)
0 0
prog.c: In function 'main':
prog.c:11:6: error: 'i' undeclared (first use in this function)
  for(i=0;i<5;i++) {
      ^
prog.c:11:6: note: each undeclared identifier is reported only once for each function it appears in
commented by (4.3k points)
0 0
Case 0: Wrong output
Case 1: Correct output
Case 2: Wrong output
Case 3: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>

int main(){
*  ***  *  *******  *     number[5]; 
*  **   *   ***** *  * *  size = 5, temporary; 
    
 **  ** * * *  ******      **  i=0;i<size;i++){ 
    **    * *    * * * ** ***  * **  **   *  ********* *     *  **  * *  * * * **     
   *  *  ** * ** *       * *  

**   *  **  **** **  * * *  *** **  **   j = 0; j < size; j++){
*  ** *** ****  * * * *  *  * ** **** * * ** **** ***     i = 0; i < size-1; i++){
* ***  * ***** ***    *  ** ** *** ** ***** **        * * ***** **     ** **  ***  > number[i+1]){
*    * ****   * ***  ** ***  *****     * ** ***  * * ***   ** ****** **  * **   *****  * * **  *  *   *   *  *   temporary;  *    ***  **** ****            * *   ****
 **   ** *       *  **** **  * *** ** * ***  *  * ** * **** *  * ***   * *  *   ** *  * *  * * **** **   ***  * = number[i];
***** * ***** ***  * *  *** * *** *  *   *    *  *    *** * * *  **  *   *   * * **   ****     *  *  **  * * **  ** * *** ** = number[i+1];
  ** *****  * * *****   * *  * * *  ** *       *     * * **  *    **  ****  **    *  ***** ** ***  * *       * * *     * = temporary; 
* ****   *** * *   **     *   **  ** * *       ** * *  *  **  * **  * *     *** *   ** ** * *
   *      **  *    * * *    ***  * * ****  ****** ******
  *    *   *  * * *   * 
 ** * ** *   *** ***** * **  *  i = 0; i < size; i++){
 ***   *** *   ****  ** *   * ***   *     **** ******* * ***  ** **  ", number[i]); **  *       * *  **** * ***  *   ** 
    ****** **  ***    *  *  * **
    
   *    *** *  * ** *** ** *  *  0;
}
100/100 answered by (220 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
Case 1: Correct output
Case 2: Wrong output
Case 3: Correct output
commented by (4.3k points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
Case 1: Correct output
Case 2: Wrong output
Case 3: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include  **   ***   **   

int main(){
*** ** ***   int number[5]; // Do not change
 *    *   int size = 5, temporary; // Do not change
** ***    
    for(int    ***  * *  * // Do not change
** **  **** **   *  **  ** ** ***  * *   **  *** **  *   // Do not change
  ***  *   *****    } // Do not change

 ***    // Your conditions start from here
** * * * *****          * **  *  * * j = 0; j < size; j++){
* *******    ** *     * **  **    * **   * *   **   i = 0; i < size-1; i++){
 ***  * * ***  ** * **  * *  * ***** *    ** *  ** * **** ** *******  * * ** *   ***  * ****  > **     ****
 *****  ******   * * **    **    *  * * *** * *  **   *    ** ** *  * *  * *  *** * * *  * ** * *  ****  * temporary; ** ** *   *   ***** *****  *** ** ***  **
 ** ********  *   **  * *  **   *  **   *** ***  *    ** * *   ***  ***  * * * *  ** * ***   **   *   *     ** *  = * **  
 *       ****       ** *  * **** *** * ** * *  *  * *  ***  *   *    ***** **     * ** ** ***   ** * ** * =  * ***
****** *  ******* *   *  **  * ** *  *  *** **   * ** * **  ** *  ****   *   **  * *  *** *   ** ** * **  * ** * ***** * = temporary; 
* **   *  * * *** *   ** * *** ** ***** * * *  * * *  *  *****     **   *** *   
* *   **    *    **  * * **       **** *** * * ** *  ** *
* * *****    **** **        * 
*******  *  *  ** ** * **** *  i = 0; i < size; i++){
   *  ** ** **  *   *     * * ****** **  *    ** * **   * *******  **        *  **  * *********** ** *  *  * **  * **** *** 
*  * *  ** * ******    
*****   
   * * ** ***  **  * ** * *  * * 0;
}
100/100 answered by (283 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
Case 1: Correct output
Case 2: Wrong output
Case 3: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include *   *  * * * 

int main(){
*  *     int number[5]; 
    int size = 5, temporary; 
    
    for(int ***    * *  *  **** 
         **    *  ** * *******  *  *  **** 
**    *    } 
*   **   * **  **  * ** ***** * * j = 0; j < size; j++){
*  ***   *    * ***** *  ***     * ***** ********** *   from left to right */
 *** * *** * * ** *****       *** *****   ** ** **   *  *  i = 0; i < size-1; i++){
 **   *    ******** ***  ** *** *  *   * *     **  * ********** *  ***  * ***        ** * i-th element with its neighbor to check if they are in order */
***   * * *** ****  * ***** * **   ** *        ** * * * *  * *   * ***   *         >  * ** ** 
**  * *  ***  **** * **********   *    **** * ***   *  *** **   ** **  *** *  **  **  *    ** **   * * exchange the values of x[i] and x[i+1] */
 **** *  **** *  **  ***** ** ********  *  * *** * *  *  **  ***  *  *** * * *  *   *****  **   * *    * temporary;  * *  ** ****** ***    ***    ****
    * *       ** *** **   *    ******* * **   **   *** * * * ****  *****  ** *  ** **  *   * *** *  *    **   *   = ** ****
 * *  * * *** *** ***  **  ****** *  **** *  * *  *   ******  ** * *** *   ***** *    ***    * * * *  *    ***   =  *** * * **
 * * * *   ***  ** **  * **  *  *  ***   ** * * * ** *** *****  **  * * *   *****  *** ******* *  **   *** ***   = temporary; 
* ** * * ******* *     ***** * *   **** ** * *  * * **    ** * * * *     * **   * ** *  
  *       *    ***** **   **   ** * *    *    **  **  * 
******* *** * ******    **  * * *
** * *   *   ***  * * * *  
*       *  ***  * **   *  *  print the array */
*         *   ***  ****    ***** * *** i = 0; i < size; i++){
* *  **  * * *   *    * ** * ** **  * **   **  **    * **  * ***   * * *** ** * ***    * *  *  *   ** ********     *     ***  *
    *****     * *  *  * * *  
 * ***   
* *  ******* *    *   ******  * * * 0;
}
100/100 answered by (153 points)
edited by
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Wrong output
commented by (4.3k points)
0 0
prog.c: In function 'main':
prog.c:30:5: warning: implicit declaration of function 'system' [-Wimplicit-function-declaration]
     system("PAUSE");
     ^~~~~~
commented by (4.3k points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
Case 1: Correct output
Case 2: Wrong output
Case 3: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
#include <stdlib.h>

int main(int argc, char *argv[])
{
* ** * * *  *****    * **     *  x[] = {77,22,88,11,22};
 *** * **  * **  *** ***  ****  ** size = 5;
    
  * *  *** *    *   ***  print the array */
   *   **  **** **   * ****   **  * i = 0; i < size; i++){
  **     *** **   * * *   ** **     * *  *  * *  *** ***    *** * * ", x[i]); **     * * ** **   **  * *** **    * * *  * * 
* ***    *    *  ** **  ***  *
*******   *** ** *   * **  *** *** *  
***  * *   ** *    ** 
*******  * **  **   *   ** I need this to happen size-times */
    **    *** ********      j = 0; j < size; j++){
* *   * *  *  * *  *  *****  *  * *   **  *      *  * from left to right */
*  *  * *   ***  ***   * ** ********** *** * ** ********* * i = 0; i < size-1; i++){
*  *  * * **  ** ****  * **    * ***  *     ** *****    **** *  * *  * *** **    ****   i-th element with its neighbor to check if they are in order */
* *     **** **** **     * ** *   * ***   *     * ****  * **  *   **  * **  *** **    *** > x[i+1]){
 *  *   *    *     * *   ****** ** *    **  *** * *    *    *  * *     *  *    **   ***** ** ***** **** ** exchange the values of x[i] and x[i+1] */
* *   *  * * *  *    ** * * ** **      *     * * **     **  * ** * ** **  ******     *   ** *****   * *  * temporary; **  *     **** **  ***   *  **   **** *
** ****   * ** *  * * *   *   *    * * *** *  *   **       *   * *   **   ** ****   *  * ** * * **  *  **   = x[i];
*** ***** ** *   * **   ***  **  *  ** *****  *       **** * * *     * **  *  *     **  * * **** *  *   **  = x[i+1];
  ** *  ***   **** *   *** **   * ***   **    * ** ** **** **   ******* * **  *** ***     **** ******* *** * ** *** ** = temporary; 
  * * ***  ***  *  ***** *  ** *   *   *  ****   ** ** *  ** * ***** ** * * *** * 
* * *      *    ***   * *** *  ******* *  * **
* * **** ***       *  ** **  * 
**        *       * * **   
  *   *** ***  ** *    *** *** print the array */
 ** * **  ** ***    ***  ** *     *  **  sorting: \n"); 
 *** **    ****  ***    i = 0; i < size; i++){
  **  *  *  **** *    **        * *  * * ** * **   *** **     *  ", x[i]); ** ***   *** ** ** **** *  **** ****   ** 
  ****  *****  *  *  ******** *
*  ** ***  **     * * ****  **  * * * **   
*  ** ** ***       ** **** 
 *  * * *** ** ** * *
 * **  ** *   *** **   ** ****    *       *  ** ** 
* **    **  **   ***** * ** ***** * **  *   *   ***    *       
**  *** ** *  ***** **** * *** 0;
}
answered by (153 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Wrong output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
#include <stdlib.h>

int main(int argc, char *argv[])
{
      ***** * *   *  *** ** * x[] = {77,22,88,11,22};
***  ** *  *****  ***     * size = 5;
    
      ** * ** *** ****  print the array */
        * *********  ***     i = 0; i < size; i++){
** *  * * * *****   *    ** * * * **     *****         ", x[i]); ** * **** *   **  ***** *  *      
  *   *  **   **   ***  **** 
***    **  *   ***  * * ***  *   **  ***
****  **    *     ****    
 *      * *   * **    **  * * I need this to happen size-times */
   ** *   * * *** *  *     ** *   j = 0; j < size; j++){
*  * ***  ** *****    ****      **    *  ** *  ** ****   * from left to right */
*  *****  * *** *  ** *   *  * * * **   *  **   * * **** i = 0; i < size-1; i++){
 * * ** ** *  *   *  *  **    *** **     **  **   *** ****  *  *** **** **  *      *** i-th element with its neighbor to check if they are in order */
* *** **  ** * * *  * ***** ***** * **      **  ** * ** * * *   ** *   ***    ** > x[i+1]){
  *  ** **  *** ****** ***** *** *****     *** *  **   *  ****  ** *** * ** *** **  **  * * *    exchange the values of x[i] and x[i+1] */
 ****   *  ** **  ** *****   * ** ******* **  ** **    ** ***** **  * **** **     ******  *  *  ** **  *   ** temporary; *   ***** *  *** *  ****  *  **** ** ** **
* **   *    **   *   *   *  *  * *    *  *   ** *     * *   ******  * **  ***  * *** *   * *   **  *   **  ***  *  * = x[i];
  ** **** **  * *        **     ** *  *   **  *  ****    **  * ******  * * *  ******   *** *****   *   *  * = x[i+1];
**   ** ****  **  *    *** *** ** ** * *  ** *  ** ***   ** *  *** *  ****   * *** ***       *** ** *     ** = temporary; 
 **  ** ** * *  ***** ** ***  * **      * **         **   **     * * **  *  **** 
* **  * * **  * * *****  **     ****** *****    *   
 ***  * ** * *   * ** ***  
*   * *       *** **     
***** ** *    ***  * * *   ** print the array */
   *** *   **** ** ***    **** * ****    * sorting: \n"); 
 **   *    *   * * ** ****   *** i = 0; i < size; i++){
 ****** * *** *       ***  *** **** *     * *  ****    ** * ** * ", x[i]); * *** * *   ** *   * ***         **
 ***   * *  ***  ** *   ***    
    * * **  ** *     *** * **  **   ***  
** * *   **   * **** **   ** * 
   *   *   *  *  ********* *
 *  **** * *  *** * **** *    *****   * **** * * **
*   **     **  ** *  *   ****  * *  **    * ** * **   
  ** * * ****   ** *******   0;
}
answered by (153 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Wrong output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
#include <stdlib.h>

int main(int argc, char *argv[])
{
***** ** *** * *     *   ** x[] = {77,22,88,11,22};
     *  **   *     *  **  ** ** size = 5;
    
   *** *    **** *****  * *  ** print the array */
  ****    *** *    * **  ** * * *  ** i = 0; i < size; i++){
     *** *  *   **  **  *** ** *   * * *    **  *  **  *   *     ***   *  ", x[i]);  * * ***   **  **   ***     * * **       * 
*    * ***  * **** * **** *
 * *  * **    ** *****     ***  **  *   **** 
   * ** *  *  ** *    *** 
****** ** *   *  *  ** *    I need this to happen size-times */
**   *** ***  **  *   * *   *   j = 0; j < size; j++){
 *** **   *   ** *** **  *  *  * *  ** **  * *  *  **  *  from left to right */
*     * ***  **** ** *   ***    ** *  ***  * *    **   **  **** *     i = 0; i < size-1; i++){
**** ***  * * * *      * *   *  * *    *** * * **   *** ** *** * * *  *  * i-th element with its neighbor to check if they are in order */
** *    *  **  *    ****  *  * *   * * **   ** ****  **   * **      ***  * *  ********** *  > x[i+1]){
 * **       ***  *** ** ** **     * ** * *  *** *  * *  * *** **    **   **      **  ****  **** *  * * ***  exchange the values of x[i] and x[i+1] */
  * **  ** *  ** *  **  * *    **  ***    ** * **        *    *** *  ****  **  ****** *  ****   **    ****  temporary; ***      *   ** ** ***** **** ** *****
**  * * * ** ******  * *  ***      * * *** **       **    * *  **** *  **    * *     *  *** ** **     * *   = x[i];
*** **      ** **** * ***  ** ***  * *      * **** *** ***********  *    * ***** *   *  * *   * *** * * *  = x[i+1];
**    ***   * * ** *  ***  *  **** *******  * * **  ** * *** ****  ** **  * *  * * *    **   * *** **  **   **  ** = temporary; 
* *  *   * ***    **  ****  **** *****  *    ******  *  *  *** *  * * ** 
* * * **   **  * *** *   *  *     *    *****   ** 
*  * ** *  * *   *  *  **    
****** ***** *  ***   * ** **
 * *       * *****  ** *  *  print the array */
 *** **  **     * ******  ** *    *** * *   sorting: \n"); 
 *    ****   * * *   ** i = 0; i < size; i++){
  * ** *  ***   *  *** **   **     ******* **  * *** * *     *  * *   ", x[i]);       *  ****  * **** * *     ** * 
    **** ***   ****  ****    ** 
*** **     **    **  *   * * * * * * *  ** **** 
**   * *** * ** *  *     *  * 
  **  * ***   **  *** ***   
   * *** ** *********    *   * **  * *       ****
**  *  **  * **  * * **** * * ** * *   **   *    **  ** **   
  * ** ********* ***   *   * *  *    0;
}
answered by (153 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Wrong output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
#include <stdlib.h>

int main(int argc, char *argv[])
{
  ***** *** * *   *** * **     x[] = {77,22,88,11,22};
   *** * ***   **** *   ***     size = 5;
    
 ******  * ***     **   ****** print the array */
   * ***   * *** *  ***         i = 0; i < size; i++){
** * * ** *  ** ** ***  ** * **** * *  *****   * ** *** * * ", x[i]); *** *  *    *     ****  **  ** *   **    
***** ***  * **   **   *    
 *  * *** * * ** *****  *** ****** *** *  
**  ***    * ****   * *** * 
     * *  *  * **    * **   *  I need this to happen size-times */
* * * **    ** *  ** **      * * j = 0; j < size; j++){
  *  *  ** *  * ***  ** * **  * *  * * **    * * from left to right */
**** **  * * ***  *    * *   **** * *******         *  * i = 0; i < size-1; i++){
 ** *   *  **   ***** ********** **  **  *  **  ***  * * ***   **  *   **** **   *  ** ** i-th element with its neighbor to check if they are in order */
* *** **  *** ****    ***    *  ***   *   ** **  ***      * *   ** * *   ** ******  ****     > x[i+1]){
  *  ***** **     ** * * *  * ** *   *     **         *   ****  * *  **** **  * *  ** ** * **  ** * ** ** exchange the values of x[i] and x[i+1] */
  ***   *  * * ** **    * * ** *    **    *** ******  **  *   *** *  *  ***  **     ******   * *** ** **   temporary;  **  **  *** ***     * ****   ***   
**     * **** * *** ** *** *** *** *      * *** *  *****   * *    **  *   *  *** **** *** * *  **  ** *** ** * = x[i];
*  * **        * *   *** ****  ********   * ** *  * ****   ****  *  * ** **  ****  **** * ** ***** **  * *  **** *** = x[i+1];
*  *   * **** *    *  * ****    *    *******   ***  * *  *    * ***   *****  *** * *  **   *  * ** *** * **  **  ***   = temporary; 
 ** **** ***  **  *  * * * * * * *  *  *  * *  **  ***  **    ** *    ** ***** *
* *   * * *  *   *   *  * * *  *  ***  *   **    * ** 
* ** * *  ***  * ** * * *  
**   * ***            
 *  **  **** ****  *    ****    print the array */
*   * ** ** *** *** *** ******     *  ** *   sorting: \n"); 
*   *        *  ** **** ******    i = 0; i < size; i++){
*   ******  ****  * ***** * ** *** * * *   * ** ** *   **** *   *     **   ", x[i]);  *  **   *   **** *   ***  ****** **
 ****  *    *** *** **  *  **
  *  * * * **  ***  ***  ** *   **    * *    ** *** **
 *  ** *  *  * **  ***    
  ** ***   ** ***  **    **     *
** * *   *** *   *** *****  ****     * * 
*  ** *****       *  * *** * **   * **   *  * **  **  *   
*** * * * ****** *   ***  *******  ** 0;
}
answered by (153 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Wrong output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
#include <stdlib.h>

int main(int argc, char *argv[])
{
* *    ** *   ****   *  **  *  * *  x[] = {77,22,88,11,22};
* * * ** *   **  *  *   * ***** **** size = 5;
    
* * **   *  *    **  ** *  *   print the array */
*  *********  * ** ******  *  i = 0; i < size; i++){
   ***  * *  *       *****   *   * ** * **  * *** * *     * ** * * ** ", x[i]);  * * ** **       **** ** * * **    *   
**    ** **  *   ********* * *
*     ****  ** *    * **       *********     *  *  
** *       * ** *** *** 
  * ****** *  *** ** * * * *** * I need this to happen size-times */
** ****    * *** * **  **  *  * * *  j = 0; j < size; j++){
 *  * ****    ***  * * ******   ******* *  * **** ***    *** **  from left to right */
***  **   ** ** *  *** **       *  *  * ****  ** ****** i = 0; i < size-1; i++){
 ****  **    ** *   * **  *   **     ***  **** *     *  * * ** *   *  *****  ** i-th element with its neighbor to check if they are in order */
 **** * * * * *  ***  ** **  ** *** ** ***   * * **   * * ****   *   **    * * * * *** > x[i+1]){
** *  *   ** *********  ** ***       **   **    ***  *** ** *  *    * * *   * ** * *  ** **    *** **  * * *    exchange the values of x[i] and x[i+1] */
 * **** ** * * *** **  * **  ****   *    * *  **  ** *  ****    ** **** * *****   * **  *** *** * * * **** * temporary;    * *** ** **    * ***  * *  *  * ** *** 
*   *      ***  *  **  * * **  ** **   **   *  **  * *      * * ****  *   *** * **   **    * ***   *      ***   * = x[i];
 *  *** ** ** * ** * * **    **  *** *** *** *    *  * * ** **  *** ** * *** ***   *   **   *    ******* ** **  *** = x[i+1];
 ** *  **  ** *  ** ****  *    * *    *    ** ** ** * * **** * **   ********** * * ** * * *  *  ******  *  * *** = temporary; 
 ** * * ** * *** * *** * *******  *** *    *** *****    *  ** *   * ** **  ** **    * 
* *    * * * * *   *     * * *** * **  * * *
 * *  *  * *  *   * **   ****
*   ** *   *** **   *   ***
* * * *  ** **   ** *  *  * **  print the array */
*   ** ** ** * ****   ******   *    ***  sorting: \n"); 
   *** **    ** ***** *  * **    i = 0; i < size; i++){
 * ** **** * ** * *   ** ** * *  *** *        *  *  **    * ** *** ", x[i]);   **   *  *  ****  *  ***  * ***** *  *    *
 ** * *    *  ** *  *    ** 
     ** * * *        * *     *   *  * ***  ** * 
** *** *  ****  **  ***  * 
 ******** **  *** ** ***   **   
**   * * ** **   **** *  ******* *  * * **  * 
* **   * ***  **  * *  **** **  ** *** ** ***       
*** ** * *   * ** ****  *     * * 0;
}
answered by (153 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Wrong output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
#include <stdlib.h>

int main(int argc, char *argv[])
{
** ** ****   ** *    * ** x[] = {77,22,88,11,22};
 ***  ***        *   **     ** size = 5;
    
    *   *** ***  ***       ** print the array */
  * *  *  ****  **     ***   ** *** i = 0; i < size; i++){
** **  * * * * **   ***   *** *  * * *      *   * ** ** ******      ***  *   ", x[i]);  * * *** ** ***     ** *** ***** *  ** * **
* **  ** **   * *  **** * 
*      *  ** **    **   *  ****   ** *  
  * *        ** * *  ** * *   
 * *   ** * * * *  ** *  **    I need this to happen size-times */
****   *    ** *     *** *    *   j = 0; j < size; j++){
 * *  *   **** ** *****   *  ***** ****   *    ** ********  from left to right */
  * * *  * *** *        ****** * ***  *   *  * *  *   * * *  *     i = 0; i < size-1; i++){
*  *****  ** *** **  * * * *  *     *    ** * *   ** * * *  *   ** ***  * **  **** i-th element with its neighbor to check if they are in order */
**   ** **** *      *** * * * **   * ***       **** ****    * **** *** **  * ******  > x[i+1]){
 **  ** * * ** ***    *    * *** ***** *   ***  * **    *  ** * *  * * * ***      *   ** * ** * * ** *** ** exchange the values of x[i] and x[i+1] */
***  * * ***   ****       ** * ** ** ** **   ** *  ** ** *  *     ******  *   *  ********  **   *    * * * **  *  temporary;  **  * **  * ** **** *   *   **  * * * *
   *  ****** * *       * ****  **  ***    **   * * *     * *   *   **  *  *    **   *** * ****  ****     * *** = x[i];
* **  **   ** ********   ** **  * ******   **   **  * *        *        ** ** **  ** *** ** * ** * *    *  = x[i+1];
 *   * ** * *  ******** *  * ** * ***  **  *** *  *  *  * *   *  *****       ****   ** * ******* *  * *** * = temporary; 
 ** **     **  ** * ** *    *** ** ** ****  **      *   *  **** ** *  * ** * * *** * ** 
** *****   ** ******  **  **  *        ******* ** ** 
 * *      **   ** * *   *
***  ***  *    * * * *  *  
******** ** * * **  ** ** **** print the array */
** * *  ******  *  *  * ** * ** * ** *  *  sorting: \n"); 
 ****   ****  * ** *  * *** i = 0; i < size; i++){
**     * *** ***  *  *   *             ***  * *  *  *  *    * *  ***** ", x[i]); **  *** *  * *  * ***  ******* *
*        ** **  *****  *    * 
** ** ***  *   ** *** ****  *******  **  
 *   * *     * ***   **
*** **  * * *  ***** ** 
      **  *  ***** * *    **    ******  * * * *
       *  *  *   **  * ********* * ** *  *****   * ** ***    
   ***   *       *  *  *  ** *** 0;
}
answered by (153 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Wrong output
commented by (4.3k points)
Page:
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.70.100.82
©2016-2025

Related questions

0 like 0 dislike
0 answers
Arrays: Bubble Sort
[Resource] asked Dec 15, 2017 in Chapter 4: Arrays by nat236919 (5.9k points)
ID: 37571 - Available when: Unlimited - Due to: Unlimited | 6 views
0 like 0 dislike
18 answers
[Exercise 20] Two-dimensional arrays: The Matrix
[Exercise] Coding (C) - asked Jan 5, 2018 in Chapter 4: Arrays by nat236919 (5.9k points)
ID: 41054 - Available when: Unlimited - Due to: Unlimited | 5.2k views
0 like 0 dislike
20 answers
[Exercise 15] Arrays: Fix me (II)
[Exercise] Fill in the blank - asked Dec 15, 2017 in Chapter 4: Arrays by nat236919 (5.9k points)
ID: 37578 - Available when: Unlimited - Due to: Unlimited | 2.6k views
0 like 0 dislike
17 answers
[Exercise 14] Arrays: Reversed Set
[Exercise] Coding (C) - asked Dec 7, 2017 in Chapter 4: Arrays by nat236919 (5.9k points)
ID: 35804 - Available when: Unlimited - Due to: Unlimited | 4.5k views
0 like 0 dislike
18 answers
[Exercise 13] Arrays: Fix me
[Exercise] Fill in the blank - asked Dec 7, 2017 in Chapter 4: Arrays by nat236919 (5.9k points)
ID: 35798 - Available when: Unlimited - Due to: Unlimited | 2.3k views
12,783 questions
183,442 answers
172,219 comments
4,824 users