Pagini recente » Borderou de evaluare (job #2668228) | Borderou de evaluare (job #789487) | Cod sursa (job #3125681)
#include <fstream>
#include <cstdlib>
using namespace std;
ifstream cin("algsort.in");
ofstream cout("algsort.out");
int compare(const void* a, const void* b)
{
const int* x = (int*) a;
const int* y = (int*) b;
if (*x > *y)
return 1;
else if (*x < *y)
return -1;
return 0;
}
int main()
{
int n; cin >> n; int arr[n];
for(int i = 0; i < n ; i++) cin >> arr[i];
qsort(arr,n,sizeof(int),compare);
for (int i=0; i<n; i++)
cout << arr[i] << " ";
return 0;
}