Advertisement
Guest User

Untitled

a guest
Apr 24th, 2018
69
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.55 KB | None | 0 0
  1. #include <iostream>
  2. using namespace std;
  3. int n,v[100],c[100];
  4. void sortare(int li,int ls)
  5. {
  6. li=0;
  7. ls=n-1;
  8. m=(li+ls)/2;
  9. i=li; j=m+1;
  10. while(i<=m && j<n)
  11. {
  12. if(v[i]<v[j])
  13. {
  14. k++;c[k]=v[i];i++;
  15. }
  16. else
  17. if(v[j]<v[i])
  18. {
  19. k++;c[k]=v[j];j++;
  20. }
  21. }
  22. if(i<=m)
  23. for(t=i;t<=m;t++)
  24. {
  25. k++;c[k]=v[t];
  26. }
  27. if(j<n)
  28. for(t=j;t<n;t++)
  29. {
  30. k++;c[k]=v[t];
  31. }
  32. for(t=1;t<k;t++)
  33. v[]
  34. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement