write top down merge sort in java without recursion

$1.$ Split the list in two halfs until each group has either $1$ or $2$ elements.

$2.$ Sort these groups.

$3.$ Merge and sort at the same time using the "comparing the first card" method.

take in input from user $($stop when $10$ inputs reached or a negative number typed$)$

example:

$2194-1<--$ original

$1249<--$sorted