Exercises

$1.$ The example program is written in old$-$fashioned procedural approach, write the equivalent

object$-$oriented approach.

$2.$ Overload the method display$()$ so it displays a predefined part of the array

Homework

$1.$ Write insertSorted$($double key$)$ member method, which inserts items into the array

according to their natural order.

$2.$ Write rotate$($int k$)$ member method, which rotates an array to the right by k positions$($ Hint.

Use another array structure$).$

Challenge Question

$1.$ Rewrite the rotate$($int k$)$ member method so no auxiliary array structure is needed.Exercises

The example program is written in old$-$fashioned procedural approach, write the equivalent

object$-$oriented approach.

Overload the method display$()$ so it displays a predefined part of the array

Homework

Write insertSorted$($double key$)$ member method, which inserts items into the array

according to their natural order.

Write rotate$($int $k)$ member method, which rotates an array to the right by $k$ positions$($ Hint.

Use another array structure$).$

Challenge Question

Rewrite the rotate$($int k$)$ member method so no auxiliary array structure is needed.