C-3
This document was uploaded by user and they confirmed that they have the permission to share it. If you are author or own the copyright of this book, please report to us by using this DMCA report form. Report DMCA
Overview
Download & View C-3 as PDF for free.
More details
- Words: 74
- Pages: 1
Data Structures and Algorithms in Java (Third Edition) M. T. Goodrich and R. Tamassia John Wiley & Sons
Solution of Exercise C-3.8 The induction assumes that the set of n ā 1 sheep without a and the set of nā1 sheep without b have sheep in common. Clearly this is not true with the case of 2 sheep. If a base case of 2 sheep could be shown, then the induction would be valid.
Solution of Exercise C-3.8 The induction assumes that the set of n ā 1 sheep without a and the set of nā1 sheep without b have sheep in common. Clearly this is not true with the case of 2 sheep. If a base case of 2 sheep could be shown, then the induction would be valid.
