0 like 0 dislike
8.1k 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
| 8.1k views
0 0
Called for Help
0 0
Called for Help

69 Answers

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

int main()

{

 int i,num[10]={0},j,tem;
*** ** * *** * * *
* ** *** *** * * * * * * ** *
* *** *** **

for(i=j+1;i<10;i++)

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

 return 0;

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

int main()

{

 int i,num[10]={0},j,tem;
* * ** * * *
* ** * ** * ** * *** ** * *
**** * * * * * *

for(i=j+1;i<10;i++)

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

 return 0;

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

int main()

{

   int i,j,num[10]={0},tmp;


* *** ** * *** * ** * * *
* * * ** * * * *** ** ** ****** * ** &num[i]);



   for(j=0;j<9;j++)
** * * * * ** ** * ** ** * ***** **
* * * **** * ** *** ** ******* **** **** * * ***
** * ** * ******* **** ** * ** ** * ** * *
* * * * ** * * **** ** ****** ** * * *** ** ** * * *** = num[j];
** * ** ** * *** *** * * * ** * * * **** ** * * **** * ** * **
******* ** * ** ***** * * * * ** ** ***** * ** * * * **
* * * ****** ** * ** * * **** * ** * *


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


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

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

int main(void)

{

* * * ** * * * ****** k = 0,j = 0,t = 0;
* ** * ** stu[10];
* * * ** ** *** = 0;k < 10;k++)
** ** ***** *** ** ** * * * ** ** ** *
* ******* * *
** ** * * * = 0;j < 9;j++)
* ** * *** * *** * *** = j+1;k < 10;k++)
* *** * * * * ** ** * ** ** ** * > stu[k])
** * * * ** * * * *** **** *****
********* * * * * * * * ***** * ** *** * * ***** = stu[j];
****** * * * *** * ** * **** * * * *** *** * * * = stu[k];
*** *** * ** ** ** *** ** **** **** * ******* ** * **** * = t;
****** *** * * * * * * ** *
** ** * **** * =0;k < 10;k++)
** * ** * * * ***** * * ********* ",stu[k]);
* **** * *** **** ** * 0; * * *

}
answered by (-8 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,m,a[10],tmp;
* ** * * **** * * * **** * * * * *
***** * ** * *** ** * * * * * **** ***** ** * * ****



    for(j=0;j<9;j++)
* * * ******* * * * * * * * ** * ** ** * * *
* ** * ****** * * * * * * *** **** * ** **** * * *** * * ** * *** * * < a[m])
* * ** *** ** ** * * *** * * * ** * ** *** **** ** **** *
* * * ** * ***** ** ** * ** ** **** * ** **** **** * ** ** * ***** * * * * * * *** * *** * = a[j];
* * * * * ** * *** *** *** ***** * *** * * ** * * * ** **** * ** **** **** ** * **** *
* ** ** * * * ** * * ** **** * * **** ** * * *** *** **** ** ** * ** * ** * **** *** *** ***
* * * ** *** * * * ** ** * * ** * * *** ** * * ***** **
* * ** ** * * *** * ** * ** ** *
** * **** ****** *** * * ** ****** * ****** *** *** ",a[m]);



  return 0 ;

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



int main()

{
**** * * ** * * ** * ** * * i, j, num[10] = {0}, tmp;


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


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


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


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

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


* * **** main()

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


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


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


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


*** *** ** * 0;



}
answered by (102 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 * ** **
*** * * * * *



int main()

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


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


*** *** * * ** ***** ** (j=0; j * *** 9; j++)
** * ****** * ** * **** *** * (i = j+1; i * * * i++)
* * ** ** * * ***** *** * * * * * ** (num[j] **** num[i])
******** ** *
**** * * * ** * ** *** * ** ** ** = num[j];
* ** ** * *** **** * * * ** * * *** ** num[i];
***** ***** * *** * ** ** * ** *** ** = tmp;


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


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

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

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
| 9k 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
| 13.3k 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
| 8k 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
| 7.1k 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
| 6.9k views
12,783 questions
183,442 answers
172,219 comments
4,824 users