Java Taskbook Level 5.8
Given an array:
{
{2, 1, 4, 3, 5},
{3, 5, 2, 4, 1},
{4, 3, 1, 5, 2},
}
Sort the elements in each subarray.
Given some array of numbers, for example, like this:
int[] arr = [1, 2, 3, 4, 5, 6];
Merge pairs of elements together:
int[] [12, 34, 56]
Display the following pyramid on the screen:
111
222
333
444
555
666
777
888
999
222
333
444
555
666
777
888
999
