I need to sort array by qsort, but something wrong.
This is example of test script :
#include <stdlib.h>
const int asd(const int *pa,const int *p2){
if (*pa > *p2) return 1;
if(*pa < *p2) return -1;
return 0;
}
int ia[5] = {1,4,3,2,5};
void aaa() {
qsort(ia,5,sizeof(int),asd);
}
Can anybody help to me?
Vladimir
Hey, why not use STL ( I am 99% sure it is based on qsort)
here is a tip from devx.com/tips/Tip/12940
Sorting With the sort() Algorithm
The generic algorithm sort() is part of the Standard Library. sort() takes two arguments of type const iterator that point to the beginning and the end of the sequence respectively:
#include
#include //definition of sort()
#include
using namespace std;
void main()
{
vector vi;
vi.push_back(7);
vi.push_back(1);
vi.push_back(19);
sort(vi.begin(), vi.end() ); // sort vi; default is ascending order
cout<< vi[0] <<", “<< vi[1] <<”, "<< vi[2] <<endl; // output: 1, 7, 19
}
When a descending order is preferred, you can use reverse iterators:
sort(vi.rbegin(), vi.rend() ); // now sort in descending order
cout<< vi[0] <<", “<<vi[1]<<”, "<<vi[2]<<endl; // output: 19, 7, 1
Danny Kalev