Guest User

Untitled

a guest
May 24th, 2018
96
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.15 KB | None | 0 0
  1. int j = 0;
  2. for(int i = 0; i <pole1.length; i++)
  3. {
  4. while(pole1[i] < pole2[j])
  5. {
  6. pole[i+j] = pole2[j];
  7. j++
  8. }
  9. pole[i+j] = pole1[i];
  10.  
  11. }
Add Comment
Please, Sign In to add comment