Summary

Conclusions

Type, range, input format, and termination condition together form the contract of a basic algorithm. Validation is needed beyond the point before arithmetic: an operation's result can also exceed the permitted bounds.

Self-check questions

1. How does var differ from a dynamic type?
2. Why does long not fix an int product that has already overflowed?
3. When does type widening lose precision?
4. How does integer division differ from floating-point division?
5. How does short-circuit evaluation work?
6. Why does hasNextInt not consume an invalid token?
7. What remains after nextInt before nextLine?
8. What is yield used for in a switch expression?
9. What actions does continue perform in for?
10. How can you prove that a loop terminates?