Computer Science – 11.3 Structured Programming | e-Consult

Pseudo-code:

1. Define a function FindBooks(books, searchTerm) that takes a list of books and a searchTerm as input.
2. Create an empty list called searchResults.
3. For each book in books:
4. If the searchTerm is found in the book.title or book.author:
5. Add the book to searchResults.
6. Return searchResults.

Efficiency Considerations: The efficiency of this approach depends on the string searching algorithm used. A simple string search might have a time complexity of O(m*n), where n is the number of books and m is the average length of the title/author. More efficient string searching algorithms (e.g., Knuth-Morris-Pratt, Boyer-Moore) could improve this. For very large lists, consider using a data structure like a Trie to speed up the search.