/**
package info.
*/
package ru.job4j.array;
/**
class info. Concatenate and sort two Arrays.
*/
public class ArrayGlue {
  /**
  method info.  ,        int.
  ""    ,           
       . ,   {1,2,3,6}  {1,3,4},  
  {1,1,2,3,3,4,6}.
  @return glueed sorted array
  @param a = first array
  @param b = first array
  */
  int[] glueArrays(int[] a, int[] b) {
        int pointer = 0;
        int bigArray = 0;
        int smallArray = 0;

        if (a.length > b.length) {
            bigArray = a.length;
            smallArray = b.length;
        } else {
            bigArray = b.length;
            smallArray = a.length;
        }
        int[] result = new int[a.length + b.length];
        for (int i = 0; i < smallArray; i++) {
            if (a[i] > b[i]) {
                result[pointer] = b[i];
                result[pointer + 1] = a[i];
                pointer += 2;
            }
            if (a[i] < b[i] || a[i] == b[i]) {
                result[pointer] = a[i];
                result[pointer + 1] = b[i];
                pointer += 2;
            }
        }
        for (int j = smallArray; j < bigArray; j++) {
            result[pointer] = a[j];
            pointer++;
        }
        return result;
    }
}

@@ -140,56 +140,257 @@
 fo. 
- ,        int.%0A  %22%22    ,           %0A       . ,  
+%D0%A1%D0%BE%D0%B7%D0%B4%D0%B0%D1%82%D1%8C %D0%BC%D0%B5%D1%82%D0%BE%D0%B4, %D0%BF%D1%80%D0%B8%D0%BD%D0%B8%D0%BC%D0%B0%D1%8E%D1%89%D0%B8%D0%B9 %D0%BD%D0%B0 %D0%B2%D1%85%D0%BE%D0%B4 %D0%B4%D0%B2%D0%B0 %D0%BE%D1%82%D1%81%D0%BE%D1%80%D1%82%D0%B8%D1%80%D0%BE%D0%B2%D0%B0%D0%BD%D0%BD%D1%8B%D1%85 %D0%BC%D0%B0%D1%81%D1%81%D0%B8%D0%B2%D0%B0 %D1%82%D0%B8%D0%BF%D0%B0 int.%0A  %22%D0%A1%D0%BA%D0%BB%D0%B5%D0%B8%D1%82%D1%8C%22 %D0%B4%D0%B2%D0%B0 %D0%BC%D0%B0%D1%81%D1%81%D0%B8%D0%B2%D0%B0 %D0%B2 %D0%BE%D0%B4%D0%B8%D0%BD, %D0%BF%D1%80%D0%B8%D1%87%D0%B5%D0%BC %D1%81%D0%B4%D0%B5%D0%BB%D0%B0%D1%82%D1%8C %D1%8D%D1%82%D0%BE %D0%BD%D0%B5 %D0%BF%D1%80%D0%BE%D1%81%D1%82%D0%BE %D0%B4%D0%BE%D0%B1%D0%B0%D0%B2%D0%BB%D0%B5%D0%BD%D0%B8%D0%B5%D0%BC %D0%B2%D1%82%D0%BE%D1%80%D0%BE%D0%B3%D0%BE %D0%BC%D0%B0%D1%81%D1%81%D0%B8%D0%B2%D0%B0 %D0%B2 %D0%BA%D0%BE%D0%BD%D0%B5%D1%86 %D0%BF%D0%B5%D1%80%D0%B2%D0%BE%D0%B3%D0%BE%0A  %D0%9D%D0%B0 %D0%B2%D1%8B%D1%85%D0%BE%D0%B4%D0%B5 %D0%B4%D0%BE%D0%BB%D0%B6%D0%B5%D0%BD %D0%BF%D0%BE%D0%BB%D1%83%D1%87%D0%B8%D1%82%D1%8C%D1%81%D1%8F %D1%81%D0%BE%D1%80%D1%82%D0%B8%D1%80%D0%BE%D0%B2%D0%B0%D0%BD%D0%BD%D1%8B%D0%B9 %D0%BC%D0%B0%D1%81%D1%81%D0%B8%D0%B2. %D0%9F%D1%80%D0%B8%D0%BC%D0%B5%D1%80, %D0%B4%D0%B2%D0%B0 %D0%BC%D0%B0%D1%81%D1%81%D0%B8%D0%B2%D0%B0
  %7B1,
@@ -396,16 +396,17 @@
 ,2,3,6%7D 
+%D0%B8
  %7B1,3,4%7D
@@ -407,17 +407,33 @@
 1,3,4%7D, 
- 
+%D0%B4%D0%BE%D0%BB%D0%B6%D0%BD%D0%BE %D0%BF%D0%BE%D0%BB%D1%83%D1%87%D0%B8%D1%82%D1%8C%D1%81%D1%8F
 %0A  %7B1,1,

Repair encoding to UTF-8