方法一:调用sort函数
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int n;
void sort(int a[], int l, int r)
{
sort(a+l,a+r+1);为什么是a+r+1呢
for (int j = 0;j<n; j ++ )
cout <<a[j]<<" ";
}
int main()
{
int l,r;
cin>>n>>l>>r;
int a[1000];
for (int i = 0; i < n; i ++ )
cin>>a[i];
sort(a,l, r);
return 0;
}
方法二:选择排序
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
void sort(int a[], int l, int r)
{
for (int i = l; i <= r; i ++ )
for (int j = i+1; j <= r; j ++ )
if(a[j]<a[i]) swap(a[j],a[i]);
}
int main()
{
int a[1000];
int n,l,r;
cin>>n>>l>>r;
for (int i = 0; i < n; i ++ ) cin>>a[i];
sort(a,l,r);
for (int i = 0; i < n; i ++ ) cout << a[i]<<" ";
return 0;
}