  We obtain a complete characterization of all orbits of a quadratic
Collatz-type recursion called the divide-or-choose-2 rule. Each orbit either
ends in a cycle whose period depends on the initial value or it goes to
infinity. We specify which initial values generate periodic orbits, and also
show that all other initial values generate orbits that go to infinity.
