--- /dev/null
+Sandro Mancuso: test-driving algorithms
+https://www.youtube.com/watch?v=iZjgj1S0FCY
+
+Attention, we do not use complicated structures like switch/case because they are more difficult to refactor,
+once you add more cases to switch there is no way back, we can not refactor that.
+Statement if with elses are also complicated, because of that we use if with returns.
+
assertThat(romanFor(1), is("I"));
assertThat(romanFor(2), is("II"));
assertThat(romanFor(3), is("III"));
+ // We jump to five because IV is an exception, it is
+ // going to be more complicated and we do not already have
+ // the pattern to extract the algorithm for the IV number.
+ assertThat(romanFor(5), is("V"));
}
}