  We reprove the countable splitting lemma by adapting Nawrotzki's algorithm
which produces a sequence that converges to a solution. Our algorithm combines
Nawrotzki's approach with taking finite cuts. It is constructive in the sense
that each term of the iteratively built approximating sequence as well as the
error between the approximants and the solution is computable with finitely
many algebraic operations.
