Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int n,v[100],c[100];
- void sortare(int li,int ls)
- {
- li=0;
- ls=n-1;
- m=(li+ls)/2;
- i=li; j=m+1;
- while(i<=m && j<n)
- {
- if(v[i]<v[j])
- {
- k++;c[k]=v[i];i++;
- }
- else
- if(v[j]<v[i])
- {
- k++;c[k]=v[j];j++;
- }
- }
- if(i<=m)
- for(t=i;t<=m;t++)
- {
- k++;c[k]=v[t];
- }
- if(j<n)
- for(t=j;t<n;t++)
- {
- k++;c[k]=v[t];
- }
- for(t=1;t<k;t++)
- v[]
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement