How to solve sorting problems in C ++? ? ? ?

丁欠欠

There are integer sequences {5,6,3,8,3,9,7,2,1,4,0}, the programming is sorted from big to small, and the sorted information is printed

The result is: 9 8 7 6 5 4 3 2 1 0

Thank you ~~~~

kevin0148

See QSort function in C

烟花残影

Bubbles, the easiest

hzxszmh

#include <functional>
#include <algorithm>
using namespace std;
int main (int argc, char * argv [])
{
int sz [] = {5,6,3,8,3,9,7,2,1,4,0};
sort (sz, sz + sizeof (sz) / sizeof (sz [0]), greater <int> ());
return 0;
}

yashiroxyz

Check out the books on "Data Structures" and "Algorithms".

zhoudaj

If you do not consider the execution efficiency, bubbling or simple selection sorting is the easiest
If you consider efficiency, you must use quick sort or Hill sort, heap sort, etc.

oij213

You can find it just by looking for it, there will definitely be in the book of data structure.
It is not difficult to write one yourself.

#include <iostream>
using namespace std;

#define SUM 10

template <class T>
void Sort(T a[], int N)
{
for(int i=0; i<N-1; i++){
for(int j=i+1; j<N; j++){
if(a[i]<a[j]) swap(a[i], a[j]);
}
}

}
int main()
{
int a[]={5,6,8,3,9,7,2,1,4,0};
Sort(a, SUM);
for(int i=0; i<10; i++)
cout << a[i] << "";

return 0;
}

diamond52

sort() generic algorithm

国家主席

void sort(int *a,int n)
{
    a[10]={{5,6,3,8,3,9,7,2,1,4,0};
    for(int i=1;i<10;i++)
    {
       int k=i-1;
       for(j=k;j<10;j++) if(a[k]<a[j]) k=j;
       int temp=a[i];a[i]=a[k];a[k]=temp;
    }
}

china1839

int swap(int A[], int n)
{
   int i, j, temp;
   for(i = 0; i <n; i++)
      for(j = i + 1; j <n-1; j ++)
          if(A[i]<A[j])
               {
                 temp = A[j];
                 A[i] = A[j];
                 A[j] = temp;
                }
  return 1;
}

main ()
{
   int A[10];
   swap(A, 10);
   for(int i = 0 ;i <10; i++)
     printf("%d, ", A[i]);
}