Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #define N 205
- using namespace std;
- int a[N],n;
- /**
- Algoritmi pe tablouri sub forma de functii
- */
- void Citire(int a[], int &n)
- {
- cin>>n;
- for(int i=1;i<=n;i++)
- cin>>a[i];
- }
- void Sort(int a[],int st, int dr, int d)///1-cresc -1-desc
- {
- bool ord=0;
- while(ord==0)
- {
- ord=1;
- for(int i=st;i<dr;i++)
- if(a[i]*d>a[i+1]*d)
- {
- swap(a[i],a[i+1]);
- ord=0;
- }
- }
- }
- void Afisare(int a[], int n)
- {
- for(int i=1;i<=n;i++)
- cout<<a[i]<<" ";
- cout<<"\n";
- }
- int main()
- {
- Citire(a,n);
- /*Sort(a,1,n,1);
- Afisare(a,n);
- Sort(a,1,n,-1);
- Afisare(a,n);*/
- Sort(a,1,n/2,1);
- Sort(a,n/2+1,n,-1);
- Afisare(a,n);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement