Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- int main()
- {
- ifstream fin("sort.in");
- int a[100],b[100],c[100],n,i,j,aux;
- fin>>n;
- fin>>a[1];
- for(i=2; i<=n; i++)
- fin>>a[i];
- for(i=1; i<=n; i++) b[i]=0;
- for(i=1; i<=n-1; i++)
- for(j=i+1; j<=n; j++)
- if( a[i] < a[j] ) b[j] = b[j]+1;
- else b[i] = b[i]+1;
- for(i=1; i<=n; i++)
- {
- aux=b[i];
- c[aux]=a[i];
- }
- for(i=1; i<=n; i++) a[i] = c[i];
- ofstream fout("sort.out");
- for(i=1; i<=n; i++)
- fout<<a[i]<<" ";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement