yvsou.com

nintendolinkfoxmailcom • 2021-04-06 15:35:08

<a href="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/截屏2021-04-06-08.45.07-1.png"><img class="alignnone size-medium wp-image-9468" src="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/截屏2021-04-06-08.45.07-1-222x300.png" alt="" width="222" height="300" /></a><a href="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/截屏2021-04-06-08.53.15.png"><img class="alignnone size-medium wp-image-9469" src="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/截屏2021-04-06-08.53.15-300x253.png" alt="" width="300" height="253" /></a> PostVer 0

Please login to reply. Login

3108655967qqcom • 2021-04-06 18:35:15

#include<stdio.h>
int main() {
int a[100],num,i=0,mid,k;
printf("Please input how many numbers you want to sort.
");
scanf("%d",&num);
for(i=0; i<num; i++) {
scanf("%d",&a[i]);
}
for(k=0; k<num-1; k++) {
for(i=0; i<num-1; i++) {
if(a[i]>a[i+1]) {
mid=a[i];
a[i]=a[i+1];
a[i+1]=mid;
}
}
}
for(i=0; i<num; i++) {
printf("%d ",a[i]);
}
return 0;
} PostVer 0

Please login to reply. Login

3301794392qqcom • 2021-04-06 18:41:50

#include<stdio.h>
#include<stdlib.h>

void BubbleSort(int a[], int len)
{
int i, j, temp;
for (j = 0; j < len - 1; j++)
{
for (i = 0; i < len - 1 - j; i++)
if (a[i] > a[i + 1])
{
temp = a[i];
a[i] = a[i + 1];
a[i + 1] = temp;
}
}
}

int main()
{
int arr[] = { 1,2,3,4,5,9,8,7,6,0 };
int len = sizeof(arr) / sizeof(arr[0]);
int i = 0;
printf("Before sorting：");
for (i = 0; i < len; i++)
{
printf("%d ", arr[i]);
}
printf("
");

BubbleSort(arr, len);
printf("After sorting：");
for (i = 0; i < len; i++)
{
printf("%d ", arr[i]);
}
printf("
");
system("pause");
return 0;
} PostVer 0

Please login to reply. Login

3218825920qqcom • 2021-04-07 20:11:17

#include <stdio.h>

int main ()

{

int a[10];

int i, j, t;

printf ("请输入十个数:
");

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

{

printf ("a[%d]=", i+1);

scanf ("%d",&a[i]);

}

for (j = 0;j < 9; j++)

for (i = 0; i < 9 - j; i++)

if (a[i] > a[i+1])

{

t = a[i];

a[i] = a[i+1];

a[i+1] = t;

}

printf ("由小到大的顺序为：
");

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

{

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

}

printf ("
");

return 0;

} PostVer 0

Please login to reply. Login

1281489327qqcom • 2021-04-07 21:38:13

#include<stdio.h>
int main()
{long long a,b,c,max,i,set;
scanf("%lld",&set);
for(i=1;i<=set;i++)
{
while(scanf("%lld%lld%lld",&a,&b,&c)!=EOF)
{if(a>b)
{max=a;
a=b;
b=c;
c=max;
}
if(b>c)
{max=b;
b=c;
c=max;
}
printf("%d
",c);
}
}
return 0;
} PostVer 0

Please login to reply. Login

3058218005qqcom • 2021-04-08 12:18:59

#include<iostream>

#include<algorithm>

using namespace std;

int main(void)

{

int a[10], i=0;

for(i; i<10; i++)

cin >> a[i];

sort(a,a+10);

for(i;i<10;i++)

cout << a[i];

return 0;

} PostVer 0

Please login to reply. Login

1917871807qqcom • 2021-04-08 13:34:43

<a href="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/4@MHBH_S6JJMMF5KXQ71.png"><img class="alignnone size-medium wp-image-9471" src="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/4@MHBH_S6JJMMF5KXQ71-300x234.png" alt="" width="300" height="234" /></a> PostVer 0

Please login to reply. Login

819354461qqcom • 2021-04-10 11:48:15

#include<iostream>
using namespace std;
int main(){
int a[100],i,j,n,x;
cin>>n;
for(i=0;i<n;i++){
cin>>a[i];
}
for(i=0;i<n-1;i++)
for(j=i+1;j<n-1;j++){
if(a[i]>a[j]){
x=a[i];
a[i]=a[j];
a[j]=x;
}
}
for(i=0;i<n;i++){
cout<<a[i]<<endl;
}
return 0;
} PostVer 0

Please login to reply. Login

wx287_oz26ft_ppvmz0yhrwncdglpjyuum • 2021-04-10 14:21:20

<ol>
<li>#include<stdio.h> int main() { int a,b[100],i,j,c; scanf("%d",&a); for(i=0;i<a;i++) { scanf("%d",&b[i]); } for(i=0;i<a-1;i++) { for(j=i+1;j<a;j++) { if(b[i]>b[j]) { c=b[i]; b[i]=b[j]; b[j]=c; } } } for(i=0;i<a;i++) { printf("%d ",b[i]); } return 0; }</li>
</ol> PostVer 0

Please login to reply. Login

wx287_oz26ftxkg9s80omiw6ifl9sdtr-s • 2021-04-10 14:36:58

<a href="http://yvsou.com/wp-content/uploads/2021/04/QQ截图20210410144239.jpg"><img class="alignnone size-medium wp-image-87847" src="http://yvsou.com/wp-content/uploads/2021/04/QQ截图20210410144239-300x146.jpg" alt="" width="300" height="146" /></a> PostVer 0

Please login to reply. Login

zboa6023gmailcom • 2021-04-10 15:09:58

<a href="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/6D12B294-8C7A-4AA9-B2E3-17E1A1C43044.png"><img class="alignnone size-medium wp-image-9475" src="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/6D12B294-8C7A-4AA9-B2E3-17E1A1C43044-300x169.png" alt="" width="300" height="169" /></a> PostVer 0

Please login to reply. Login

1498139310qqcom • 2021-04-11 11:46:01

<a href="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/SharedScreenshot-2.jpg">Select sort：<img class="alignnone size-medium wp-image-9476" src="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/SharedScreenshot-2-300x165.jpg" alt="" width="300" height="165" /></a> PostVer 0

Please login to reply. Login

2287245796qqcom • 2021-04-11 12:18:08

<a href="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/F0TSQZOR0@_5USB.png"><img class="alignnone size-medium wp-image-9477" src="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/F0TSQZOR0@_5USB-300x169.png" alt="" width="300" height="169" /></a> PostVer 0

Please login to reply. Login

1634605411qqcom • 2021-04-11 13:02:58

#include<iostream>
void swap(int* a, int* b) {
int c = *a;
*a = *b;
*b = c;
}
int main() {
int a[10]= {12, 23, 3, 14, 5, 6, 17, 8, 39, 11};
for(int i = 0; i < sizeof(a)/sizeof(a[0]); ++i) {
for(int j = sizeof(a)/sizeof(a[0])-1; j > i; --j) {
if(a[j] < a[j-1]) {
swap(&a[j], &a[j-1]);
}
}
}
return 0;
} PostVer 0

Please login to reply. Login

wx287_oz26ftyeszxunhjb6ehly8qq5vdi • 2021-04-11 16:43:01

#include<iostream> using namespace std; int main(){ int a[100],i,j,n,x; cin>>n; for(i=0;i<n;i++){ cin>>a[i]; } for(i=0;i<n-1;i++) for(j=i+1;j<n-1;j++){ if(a[i]>a[j]){ x=a[i]; a[i]=a[j]; a[j]=x; } } for(i=0;i<n;i++){ cout<<a[i]<<endl; } return 0; }
PostVer 0

Please login to reply. Login

13989597486163com • 2021-04-11 18:45:01

<a href="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/FL77F68D5WGD5XA48L.png"><img class="alignnone size-medium wp-image-9478" src="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/FL77F68D5WGD5XA48L-300x156.png" alt="" width="300" height="156" /></a> PostVer 0

Please login to reply. Login

rababboug69gmailcom • 2021-04-12 06:49:37

#include<stdio.h>
void quicksort(int a[25],int first,int last)
{
int i, j, pivot, temp;

if(first<last){
pivot=first;
i=first;
j=last;

while(i<j){
while(a[i]<=a[pivot] && i<last)
i++;
while(a[j]>a[pivot])
j--;
if(i<j){
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}

temp=a[pivot];
a[pivot]=a[j];
a[j]=temp;
quicksort(a,first,j-1);
quicksort(a,j+1,last);

}
}

int main()
{
int i, n, a[25];

printf("Enter total no.of elements: ");
scanf("%d",&n);

printf("Enter the elements: ");
for(i=0;i<n;i++)
scanf("%d",&a[i]);

quicksort(a,0,n-1);

printf("Sorted Array: ");
for(i=0;i<n;i++)
printf(" %d",a[i]);

return 0;
} PostVer 0

Please login to reply. Login

542236691qqcom • 2021-04-12 17:35:17

<a href="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/屏幕截图-2021-04-12-174001.png"><img class="alignnone size-medium wp-image-9479" src="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/屏幕截图-2021-04-12-174001-228x300.png" alt="" width="228" height="300" /></a> PostVer 0

Please login to reply. Login

387940240qqcom • 2021-04-12 19:10:16

<a href="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/屏幕截图-2021-04-08-140612.jpg"><img src="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/屏幕截图-2021-04-08-140612-300x126.jpg" alt="" width="300" height="126" class="alignnone size-medium wp-image-9480" /></a> PostVer 0

Please login to reply. Login

2653815589qqcom • 2021-04-12 20:27:50

<a href="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/Z9TJHS3960THMGBZ9TN.png"><img src="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/Z9TJHS3960THMGBZ9TN-300x202.png" alt="" width="300" height="202" class="alignnone size-medium wp-image-9483" /></a> PostVer 0

Please login to reply. Login

981193371qqcom • 2021-04-12 21:23:56

<a href="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/W10XTMIR8W84RA.jpg"><img class="alignnone size-medium wp-image-9484" src="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/W10XTMIR8W84RA-300x212.jpg" alt="" width="300" height="212" /></a> PostVer 0

Please login to reply. Login

2955836006qqcom • 2021-04-13 07:26:50

#include<iostream> using namespace std;

int main(){

int i,j,p,a[10]; for(i=0;i<10;i++){ cin>>a[i]; }

for(i=0;i<9;i++)

for(j=i+1;j<9;j++){ if(a[i]>a[j]){ x=a[i]; a[i]=a[j]; a[j]=p; } }

for(i=0;i<10;i++){ cout<<a[i]<<endl; } return 0; } PostVer 0

Please login to reply. Login

1772435220qqcom • 2021-04-13 16:22:26

#incude <iostream> using namespace std; int main()Y int a[100]ijnx cin>>r, for(=Oi <nit+) i>>ali )for(i=Oi<n-1.i+ +) forG=i+1j<n-1j++)if(a[j>aiMx=a[i]; a[i]=a[i]; a[li]=x; } } for(i=O;i<n;i++){ cout<<a[li]<<endl; } return 0; } PostVer 0

Please login to reply. Login

1017364560qqcom • 2021-04-17 11:34:06

#include <stdio.h>
int main()
{
int a[10]={12,4,9,1,67,98,100,89,3,35};
int i,j,t;
for(i=0;i<10-1;i++)
{
for(j=0;j<10-i-1;j++)
{
if(a[j]>a[j+1])
{
t=a[j+1];
a[j+1]=a[j];
a[j]=t;
}
}
}
printf("排列好的数列是：
");
for(i=0;i<10;i++)
{
printf("%d ",a[i]);
}
return 0;
}
<a href="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/冒泡排序.png"><img src="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/冒泡排序-300x203.png" alt="" width="300" height="203" class="alignnone size-medium wp-image-9498" /></a> PostVer 0

Please login to reply. Login

1115727260qqcom • 2021-04-18 19:14:10

#include <stdio.h>
#define N 10
int main()
{
int a[N] = { 3,4,6,7,1,2,8,9,5,0 };
int temp, i, j;

for (i = 0; i < N - 1; i++)
for (j = 0; j < N - i - 1; j++)
if (a[j] > a[j + 1])
{
temp = a[j + 1];
a[j + 1] = a[j];
a[j] = temp;
}

printf("result:
");
for (i = 0; i < N; i++)
printf("%d ", a[i]);
return 0;
} PostVer 0

Please login to reply. Login

2848519344qqcom • 2021-04-20 00:25:38

#include<algorithm>#include<iostream>using namespace std;int main(){int main(){int a[5],temp;for(int i=0;i<5;i++)
{cin>>a[i];}for(int i=0;i<=4;i++)for(int j=i+1;j<5;j++){if(a[j]<a[i]){temp=a[j];a[j]=a[i];a[i]=temp;}
}for(int i=0;i<5;i++)cout<<a[i]<<"";return 0;} PostVer 0

Please login to reply. Login

wx287_oz26ftx_gczjz0jpscvm1-d3flry • 2021-04-20 09:00:55

<em><a href="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/L0M3NO498V4F7M0AQ1N0S.png"><img class="alignnone size-medium wp-image-9528" src="http://www.yvsou.com/wp-content/uploads/sites/30/2021/04/L0M3NO498V4F7M0AQ1N0S-300x194.png" alt="" width="300" height="194" /></a></em> PostVer 0

Please login to reply. Login

wx287_oz26ft4i1taklosxq83xveqlblcc • 2021-05-05 20:42:23

#include<algorithm>

#include<iostream>

using namespace std;

int main( ){

int a[5] , temp;

for(int i=0;i<5;i++){

cin>>a[i] ;

}

for(int i=0;i<=4;i++)

for(int j=i+1;j<5;j++)

{

if(a[j]<a[i])

{

temp=a[j];

a[j]=a[i];

a[i]=temp;

}

}

for(int i=0;i<5;i++)

cout<<a[i]<<" ";

return 0;

} PostVer 0

Please login to reply. Login

2542886026qqcom • 2021-05-05 21:00:54

<a href="http://www.yvsou.com/wp-content/uploads/sites/30/2021/05/屏幕截图-2021-05-05-210659.jpg"><img src="http://www.yvsou.com/wp-content/uploads/sites/30/2021/05/屏幕截图-2021-05-05-210659-300x180.jpg" alt="" width="300" height="180" class="alignnone size-medium wp-image-9584" /></a> PostVer 0

Please login to reply. Login

1719538377qqcom • 2021-05-09 15:37:49

public void selectSort(int[] arr) {
for (int i = 0; i < arr.length - 1; i++) {
for (int j = i + 1; j < arr.length; j++) {
if (arr[i] > arr[j]) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
} PostVer 0

Please login to reply. Login

1525693772qqcom • 2021-05-13 15:35:35

<a href="http://www.yvsou.com/wp-content/uploads/sites/30/2021/05/77T_O9H47FTXJ6@EV7N@P.png"><img class="alignnone size-medium wp-image-9598" src="http://www.yvsou.com/wp-content/uploads/sites/30/2021/05/77T_O9H47FTXJ6@EV7N@P-300x253.png" alt="" width="300" height="253" /></a> PostVer 0

Please login to reply. Login

homework-6 Version 0
👤 Author: by writer 2021-04-05 23:40:43

Reversion History