[Exercise 16] Arrays: Bubble-sort

Question

6.6k 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 Dec 15, 2017 in Chapter 4: Arrays by nat236919 (5.9k points)
ID: 37580 - Available when: Unlimited - Due to: Unlimited | 6.6k views

46 Answers

Page:

« prev
1
2
3
4
5
next »

410630017 · Answer 1 · 2017-12-20 14:35:47

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;
}