1025: [编程入门]数组插入处理——题解

int main()
{
	int sz = 0;
	int a = 0;
	int arr[] = { 1,7 ,8, 17, 23, 24, 59, 62, 101 };
	scanf("%d", &a);
	sz = sizeof(arr) / sizeof(arr[0]);
	for (int i = 0; i < sz; i++)
	{
		if (a < arr[i+1]&&a>arr[i])
		{
			printf("%d\n", arr[i]);
			printf("%d\n", a);
			continue;
		}
		printf("%d\n", arr[i]);
	}
	return 0;
}

我自己做的倒序，乱序都能用
#include<stdio.h>

int main()
{
	int n[10],i;
	int tmp=0,z=0,x=0,g=0;
	for(i=0;i<9;i++)
	{
		scanf("%d",&n[i]);
	}
	scanf("%d",&n[9]);
	for(z=0;z<=9;z++)
	{
		for(x=0;x<=9;x++)
		{
		if(n[x]>n[x+1])
		{
			tmp=n[x];
			n[x]=n[x+1];
			n[x+1]=tmp;
		}
		}
	}
	if(n[0]<n[9])
	for(g=0;g<10;g++)	
	{printf("%d\n",n[g]);}
	else
	for(g=10;g<0;g--)	
	{printf("%d\n",n[g]);}
	return 0;
}

为啥我的错了
#include <iostream>
#include<vector>
using namespace std;

int main()
{
	vector <int> str;
	int number;
	while (1) {
		cin >> number;
		str.push_back(number);
		if (cin.get() == '\n')
			break;
	}
	int len = str.size();
	for (int i = 0; i < len; i++) {
		cout << str[i];
	}
	cout << '\n';
	int m;
	cin >> m;
	str.push_back(m);
	len = str.size();
	for (int i = 0; i < len-1; i++) {
		int n;
		if (str[i] >= m) {
		    n = str[i];
			str[i] = m;
			str[i+1] = n;
		}
	}
	for (int i = 0; i < len; i++) {
		cout << str[i];
	}
	return 0;
}

#include<stdio.h>
int main()
{
	int a[9];
	for(int i=0;i<9;i++)
	{
	    scanf("%d",&a[i]);
	}
	int b[10];
	int n;
	scanf("%d",&n);
	for(int i=0;i<9;i++)
	{
	    if(a[i]<n)
	    {
	        b[i]=a[i];
	    }
	    if(a[i]>n)
	    {
	        b[i]=n;
	        b[i+1]=a[i];
	    }
	}
	for(int i=0;i<10;i++)
	{
	    printf("%d ",b[i]);
	}
	return 0;
}
想请问一下为什么这样子写，插入的50的后面出现了好几个相同的数字50呢？

#include<stdio.h>
int main(){
    int arr[10];
    for (int i = 0; i < 10; i++)
    {
        scanf("%d", &arr[i]);
    }
     for (int i =0;i<10-1;i++){
            for (int j = 0;j<10-i-1;j++){
                if (arr[j+1] < arr[j]){
                    int tmp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = tmp;
                }
            }
        }
        for (int k = 0; k < 10; k++)
        {
            printf("%d ", *(arr + k));
        }
    return 0;
}

# include <stdio.h>
int main() {
	int i, n, a[9];
	for (i = 0; i < 9; i++) {
		scanf("%d", &a[i]);
	}
	scanf("%d", &n);
	for (i = 0; i < 9; i++) {
		if (a[i] <= n)
			printf("%d\n", a[i]);
		else {
			printf("%d\n", n);
			for (; i < 9; i++)
				printf("%d\n", a[i]);
		}
	}
	return 0;
}

思路很乱但终于整出来了
#include<stdio.h>
int main()
{
	int arr[9];
	int i = 0;
	int x = 0;
	while (i < 9)
	{
		scanf("%d", &arr[i]);
		i++;
	}
	arr[9] = arr[8];
	scanf("%d", &x);
	for (i=1;i<9;i++)
	{
		if (x < arr[i]&&x>arr[i-1])
		{
			int h = 8;
			while (h > i)
			{
				arr[h] = arr[h - 1];
				h--;
			}
			arr[i] = x;
		}
	}
	for (i = 0; i < 10; i++)
	{
		printf("%d\n", arr[i]);
	}
	return 0;
}

#include<stdio.h>
int main()
{
    int a[9];
    for(int x=0;x<9;++x)
    {
        scanf("%d",&a[x]);
    }
    int b[10];
    for(int s=0;s<9;++s)
        {
            b[s]=a[s];
        }
    scanf("%d",&b[9]);
    for(int j=1;j<10;++j)
    {
        for(int i=0;i<10-j;++i)
        {
            if(b[i]>b[i+1])
            {
                int t=b[i];
                b[i]=b[i+1];
                b[i+1]=t;
            }
        }

    }
    for(int y=0;y<10;y++)
    {
        printf("%d\n",b[y]);
    }
    return 0;
}