C++sort排序

一系列数从大到小/从小到大排序

#include<iostream>
#include <algorithm>

using namespace std;

int main()
{
	int arr[10];
	for (int i = 0; i < 10; i++)
	{
		cin >> arr[i];
	}
	sort(arr, arr + 10);//从小到大排序
	for (int i = 0; i < 10; i++)
	{
		cout << arr[i]<<" ";
	}
	cout << endl;
	sort(arr, arr + 10, greater<int>());//从大到小排序
	for (int i = 0; i < 10; i++)
	{
		cout << arr[i]<<" ";
	}
	
	return 0;
	
}

使用sort()函数将随机数组成的数组进行去重并排序

#include<iostream>
#include<algorithm>
using namespace std;
//随机数去重+排序
int randinit[1005];
int sortp[1005];
int main()//整体思想：进行排序后若后一个的数与前一个相同则为重复不进行赋值。
{
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		randinit[i] = rand() % 1000;//产生0-1000的随机数进行赋值
	}
	for (size_t i = 0; i < n; i++)
	{
		cout << randinit[i] << " ";
	}
	cout << endl;
	sort(randinit, randinit+n);
	int q = 0;
	for (int i = 0; i < n; i++)
	{
		//进行去重
		if (i != 0) {
			if (randinit[i] == randinit[i - 1]);
			else {
				sortp[q] = randinit[i];
				q++;
			}
		}
		else {
			sortp[q] = randinit[i];
			q++;
		}
	}
	cout << q << endl;
	for (int i = 0; i < q; i++)
	{
		cout << sortp[i] << " ";
	}
	return 0;
	
}