|
@kiwidude
Alright, case closed, thanks
@chaley
this is not a 'must be'.
For example, you could use a hashset with authors (so every author is just inserted once) and one for titles.
If you find a match in both sets, you lookup the books having the matched title (A). Than you lookup the authors (B) of this book and check if these authors (B) would match any titles written by Author (A).
Than it is a match. No big memory issue and even not a big CPU-issue I think.
|