Abstract
This chapter builds on the techniques of object-oriented programming and unit testing that were used in Chapter 10 and introduces a new programming technique, recursion. The problem that we will solve is the following: given any English word, what are all the anagrams of it?
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to APress Media, LLC, part of Springer Nature
About this chapter
Cite this chapter
Lavers, T. (2021). Anagrams. In: Learn to Program with Kotlin. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-6815-5_11
Download citation
DOI: https://doi.org/10.1007/978-1-4842-6815-5_11
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-6814-8
Online ISBN: 978-1-4842-6815-5
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)