import java.util.

Arrays;

public class InsertSortedArray {

public static int[] tambahkanNilaiTerurut(int[] H, int X) {
int[] newArr = new int[H.length + 1];
int i = 0;

while (i < H.length && H[i] < X) {

newArr[i] = H[i];
i++;
}

newArr[i] = X;

while (i < H.length) {

newArr[i + 1] = H[i];
i++;
}

return newArr;
}

public static void main(String[] args) {

int[] H = {1, 3, 5};
int X = 4;
H = tambahkanNilaiTerurut(H, X);
System.out.println(Arrays.toString(H)); // Output: [1, 3, 4, 5]
 H = new int[] {1, 3, 4, 5};
X = 7;
H = tambahkanNilaiTerurut(H, X);
System.out.println(Arrays.toString(H)); // Output: [1, 3, 4, 5, 7]

H = new int[] {1, 3, 4, 5, 7};

X = 2;
H = tambahkanNilaiTerurut(H, X);
System.out.println(Arrays.toString(H)); // Output: [1, 2, 3, 4, 5, 7]
}
}