Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cmath>
- using namespace std;
- int cifpare(int n)
- {
- if(n==0)
- return 0;
- if(n%2==0)
- return 1+cifpare(n/10);
- else
- return cifpare(n/10);
- }
- void sortare(int a[], int n)
- {
- int sem=0;
- for (int i=0; i<n-1; i++)
- if ( cifpare(a[i]) > cifpare(a[i+1]) || ( cifpare(a[i])==cifpare(a[i+1]) && a[i]>a[i+1]) )
- {
- sem=1;
- swap(a[i], a[i+1]);
- }
- if(sem)
- sortare(a,n);
- }
- int main()
- {
- int n, a[100];
- cin>>n;
- for(int i=0; i<n; i++)
- cin>>a[i];
- sortare(a,n);
- cout<<endl;
- cout<<endl;
- for(int i=0; i<n; i++)
- cout<<a[i]<<" ";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement