Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- using namespace std;
- int a[10001];
- void Interclasare(int st, int mij, int dr)
- {
- int c[1001];
- int i = st, j = mij, ind = st;
- while(i < mij && j < dr)
- {
- if(a[i] < a[j])
- {
- c[ind++] = a[i++];
- }
- else
- {
- c[ind++] = a[j++];
- }
- }
- while(i < mij)
- {
- c[ind++] = a[i++];
- }
- while(j < dr)
- {
- c[ind++] = a[j++];
- }
- for(int i = st; i < dr; i++)
- {
- a[i] = c[i];
- }
- }
- void Merge(int st, int dr)
- {
- if(dr <= st)
- {
- return;
- }
- int mij = (st + dr) / 2;
- Merge(st, mij);
- Merge(mij+1, dr);
- Interclasare(st, mij, dr);
- }
- int main()
- {
- int n;
- cin >> n;
- for(int i = 0; i < n; i++)
- {
- cin >> a[i];
- }
- Merge(0,n);
- for(int i = 0; i < n; i++)
- {
- cout << a[i] << ' ';
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement