0 like 0 dislike
10.4k views
請設計一程式,讓使用者輸入十個正整數,程式會將這十個數從小到大輸出。

Sample input:

5 3 1 6 4 8 9 7 2 2

Sample output:

1 2 2 3 4 5 6 7 8 9
[Exercise] Coding (C) - asked in 作業 by (18k points)
ID: 14288 - Available when: Unlimited - Due to: Unlimited
| 10.4k views
0 0
Called for Help
0 0
Called for Help

69 Answers

0 like 0 dislike
Hidden content!
#include <stdio.h>



int main()

{
* *** *** * * * * *** num[10],tmp;
** * *** ** * ** ***** i,j;


*** * * * ** ***** ***** **** *** *
* * ** *** * *** ** *** * * * ** * ** * *


* * ** * *** ** *** * *** **** *
*** ** ** * * *** * * ** **** ** *****
* ** ** * * * ** (num[j]>num[i])

    {
* ** *** *** * * * ** * *** ** ** * * * ** * **
*** *** * *** ** ** **** ** * * **
** * * * ****** * * ** * * * ****
*** * ** * * **
*** *** ** * ** * ** * **** *
* * * * * * ** * * * **** **** * * * ** * ",num[i]);

}
answered by (-162 points)
0 like 0 dislike
Hidden content!
#include<stdio.h>
* ** *** ***** * **



int main()

{
* * ** * * * * i,j,n[10],m;


* *** * * * *** * ** ** ** ** ***
* ** ** ******** ** ** *** ***** * * ** **


*** *** * * * *** ****


***** * * * *** ** *** * * *** *


* ** * ** * * * **** * ****

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

   }
* ** ** * * * * ** *


** ** * * *** * ** * ** * ",n[i]);


** * * * * ** * ******
* ** * * **** **** 0;





}
answered by (-103 points)
0 like 0 dislike
Hidden content!
* * *** ** ****
**** ****** * ** * * *



int **

{

int a [10];

int i,j,t;



for ( i = 0 ; i < 10 ; i++ )
** * *** * * ********** *** ** *** * **



for ( j = 0 ; j * 9 ; j++ )
* *** *** ** ****** *** * ( i = j+1 ; i ** 10 ;i++ )
* *** * *** **** * * * ** * ***** * ***** * ( a[j] *** a[i] )
******* ** **** * * * * * * ** * ** * ** ****** *
*** ** ******** *** ** **** ** * * * **** * * * * * * *** ** = a[j];
*** ** *** *** **** **** * * * * ** * *** * **** *** ** *** = a[i];
****** * ****** * ** * * * ** **** ***** * ******* * **** * * ** ** * = t;
**** ** ** *** * *** * *** ** * * * **



for ( i = 9 ; i * * 0 ; i--)
*** * * * * * *** * *



return 0;

}
answered by (-157 points)
0 like 0 dislike
Hidden content!
#include * ** **** ***



int main()

{


* ** * i, j, num[10], tmp;
* * * *** = 0; i < 10; i++)


* * * ** * ** **** * * ***** * **




***** ***** = 0; j < 9; j++)
* ** * ** ** *** ** ** ***** * = j+1; i < 10; i++)


* * * *** * * * ** **** ***** * **** * num[i])
* **** * * ** **
** * * * * ** * *** * * * * ** **** * * ** ** * ** *
**** * * * *** ** *** **** ** * * * * * * *** ** = num[i];
** * * * * *** * ******* * * **** * = tmp;
* * * *** * *** *** * *** **


*** ** * *** ** ** * ***** = 0; i < 10; i++)
** * ** *** ** * **** **** * ** * ** ***** * * * num[i]);


*** **** * ** * ** 0;


**** ** * * **** * ***
answered by (-120 points)
0 like 0 dislike
Hidden content!
* *** * **** ***
* ** * * ** *** * *



int main()

{

 int i, j, tmp, num[10];
* * * * * = 0;i < 10;i++)
*** **** * * ** * * **** **** ** * * **** * ****
* ** *** = 0;j < 9;j++)
* *** ** **** * * * ***** = j + 1;i < 10;i++)
* * ** ***** * * * ** ** * * * > num[i])
** * * * * *** *** * ** **** ***
* *** ***** ** ** * ** * * * *** * ** * ** *** * ****** = tmp;
** ** * * * **** * *** *** * * ** *** ***** * = num[i];
* *** ** ** * * *** * *** * *** ** ***** * * * *** * = tmp;
* ** **** * * * * ** **** **** * *
* * * *** * = 0; i < 10; i++)
* * * *** * **** *** ** **
* * ** 0;

}
answered by (-100 points)
0 like 0 dislike
Hidden content!
#include<stdio.h>
* ****** * ** *



int main()

{
** **** * *** * * * i,j,n[10],m;


* ** ** * *** **** * **
* *** * ** ** * * * ** ** * ** ***


* ** * * ***** * **** * ***


* ** *** ** * * * * * * * * * *


*** ** ** ** ** ** *

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

   }
** * * *** * * ***** ** ** ** *


**** * * * ** ***** ",n[i]);


** *** * * ** * * ** ** ** *
*** * * ** * *** 0;





}
answered by (-124 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>



int main()

{
** ** ***** * *** * *** num[10],tmp;
* *** ** *** ** *** i,j;


** **** ** ** * * * * * *
* ** *** * ** * * ** ** * **** * ** * * **** * *


** ** ** ** **** **** **** * ** *
* * * **** ** *** ** ** * **** *
* **** * ***** * **** (num[j]>num[i])

    {
* * *** ** ** * ** * *** * * * **** *** * ******
*** *** ** * * * * * ***** * * ***** *
** *** * * * * * * **** * *** ** *****
**** * * * * * *
** * * * * * * **** ** *** * ** * ***
* ** * * ** * * * * ****** *** ****** ** ** ** * ",num[i]);

}
answered by (-114 points)
0 like 0 dislike
Hidden content!
* * * * * ** ***
* * * * *** ***



int main()

{

int ** ****
** * * **
* ** * ** **** *** **
* * * **
* * ** * **** **
** ** * * * * * ** * *

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

}
* * **** ***

printf("%d ",num[i]);

return 0;

}
answered by (-248 points)
0 like 0 dislike
Hidden content!
#include<stdio.h>

#include<stdlib.h>



int main()

{

    int i,j,num[10],tmp;


** * ** ** *** ***** = 0 ; i < 10 ; i++ )
**** * ********* ** * * * * *** ** * ** * ** * * ****


*** * ** ** * **** * = 0 ;j < 9; j++)
* * * ** * * ** * *** * * * * * *** * ** * + 1 ;i < 10 ; i++)
******* * ** * * *** ***** ** ** * * * ** **** * ** * ** * * * ** * * * ***
* * ** * ** * ** * ** * ***** ** * **** ***** ** *
***** ** * * *** **** ** * ** **** * * * *** * ** ** ** * * * ** *** * * *
* ** * ** * * * *** * ** * * * *** ** **** * *** * * *** * ** * *
** *** ** *** ****** *** ****** * **** ** ** * ** *** * * **** **** *
* ** * ** * * **** * ** * ** *** *** ** *** * * **** * ** *

    for(i = 0 ;i < 10 ;i++)
* ** **** * * ** ** ** ** * * * * * ** ** * ** ** **
* **** * ***** **** * *** ** * ** **** * *
* *** ** * * * * ** *** ** * 0;

}
answered by (-103 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>

int main()

{
***** ** * ** ** ** i ,j ,N[10] ,tmp;
*** * *** **** ** ; i<10 ;i++)
* * * * ****** * *** ** * * * * * *** * ** ** &N[i]);
* **** * ***** * * *** ; j<9 ; j++)
*** ***** ** * *** * *** * ; i<10 ;i++)
* * ** * ** ** *** * * * ** *** * * * * *
* **** ** * * *** ** * ** * * ** ** * **** ***
** * ** ** *** * * * * **** ** * * ** * * * * * *** * ;
* **** * ** * ** *** * * *** * * * **** * * * * * * ** ;
* *** * * ***** * ** * ****** *** ***** * ** * ** * * * * ;
*** *** *** ** * ** * ** * **** ** * * * * **
** ** * ** * ; i<10 ;i++)
*** * * ** * *** * * * * ** ** ** ** * ***** * ", N[i]) ;


* *** * *** ****** 0 ;

}
answered by (-88 points)
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:104.23.243.108
©2016-2026

Related questions

0 like 0 dislike
76 answers
[Exercise] Coding (C) - asked Oct 19, 2016 in 作業 by Shun-Po (18k points)
ID: 14120 - Available when: Unlimited - Due to: Unlimited
| 11.7k views
1 like 0 dislike
129 answers
[Exercise] Coding (C) - asked Oct 19, 2016 in 作業 by Shun-Po (18k points)
ID: 14119 - Available when: Unlimited - Due to: Unlimited
| 17k views
0 like 0 dislike
65 answers
[Exercise] Coding (C) - asked Oct 19, 2016 in 作業 by Shun-Po (18k points)
ID: 14272 - Available when: Unlimited - Due to: Unlimited
| 10.4k views
0 like 0 dislike
64 answers
[Exercise] Coding (C) - asked Oct 13, 2016 in 作業 by Shun-Po (18k points)
ID: 13763 - Available when: Unlimited - Due to: Unlimited
| 8.9k views
1 like 0 dislike
48 answers
[Exercise] Essay (Open question) - asked Nov 2, 2016 in 作業 by Shun-Po (18k points)
ID: 16865 - Available when: Unlimited - Due to: Unlimited
| 8.8k views
12,783 questions
183,442 answers
172,219 comments
4,824 users