c++数组排序插入_c++数组排序填充

**

解题1：

**
**

std::vector

**

#include <iostream>
#include <vector>
int main()
{
	std::vector<int> a {1, 3, 14, 25, 31, 32, 58, 73, 98, 105};
	int x{};
	std::cin >> x;
	int* pa = &a[0];
	for (int i = 0; i < 11; i++)
	{
		if ((a [0]>a[1]&&x > * pa)|| (a[0] < a[1] && x < * pa))//（大神写法^：规则0^0=0  0^1=1  1^0=1  1^1=0）(a[0]>a[1])^(x < * pa)
		{
			a.insert(a.begin()+i,x);
			break;
		}
		pa++;
	}
	for (int i :a)
	{
		std::cout << i << "\n";
	}
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

**

解题2：

**

动态内存，内存复制，内存重新分配

**

**

#include <iostream>
int main()
{
	int zxsort[5]{125,94,85,21,5};
	int dxsort[5]{ 5,21,85,94,125 };
	int* rsort;
	int a;
	bool iszx{ dxsort[0] > dxsort[1] };
	rsort = (int*)malloc(6 * sizeof(int));
	memcpy(rsort, dxsort, 5 * sizeof(int));
	int count = 6;
	do
	{
		std::cin >> a;
		for (int i = 0; i < count; i++)
		{
			if (iszx ^ (rsort[i] > a))
			{
				int b = rsort[i];
				rsort[i] = a;
				a = b;
			}
			else if (rsort[i] == a)
			{
				int b = rsort[i];
				rsort[i] = a;
				a = b;
			}
		}
		for (int i = 0; i < count; i++)
		{
			std::cout << rsort[i] << std::endl;
		}
		++count;
		rsort = (int*)realloc(rsort,count*sizeof(int) );
	} while (a!=13);
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37