At long last the approach that has helped thousands of learners memorize Japanese kanji has been adapted to help students with Chinese characters. Book 1 of Remembering Simplified Hanzi covers the writing and meaning of the 1,000 most commonly used characters in the simplified Chinese writing system, plus another 500 that are best learned at an early stage. (Book 2 adds another 1,500 characters for a total of 3,000.) Of critical importance to the approach found in these pages is the systematic arranging of characters in an order best suited to memorization. In the Chinese writing system, strokes and simple components are nested within relatively simple characters, which can, in turn, serve as parts of more complicated characters and so on. Taking advantage of this allows a logical ordering, making it possible for students to approach most new characters with prior knowledge that can greatly facilitate the learning process. Guidance and detailed instructions are provided along the way. Students are taught to employ "imaginative memory" to associate each character’s component parts, or "primitive elements," with one another and with a key word that has been carefully selected to represent an important meaning of the character. This is accomplished through the creation of a "story" that engagingly ties the primitive elements and key word together. In this way, the collections of dots, strokes, and components that make up the characters are associated in memorable fashion, dramatically shortening the time required for learning and helping to prevent characters from slipping out of memory.

Algorithmic puzzles are puzzles involving well-defined procedures for solving problems. This book will provide an enjoyable and accessible introduction to algorithmic puzzles that will develop the reader's algorithmic thinking. The first part of this book is a tutorial on algorithm design strategies and analysis techniques. Algorithm design strategies — exhaustive search, backtracking, divide-and-conquer and a few others — are general approaches to designing step-by-step instructions for solving problems. Analysis techniques are methods for investigating such procedures to answer questions about the ultimate result of the procedure or how many steps are executed before the procedure stops. The discussion is an elementary level, with puzzle examples, and requires neither programming nor mathematics beyond a secondary school level. Thus, the tutorial provides a gentle and entertaining introduction to main ideas in high-level algorithmic problem solving. The second and main part of the book contains 150 puzzles, from centuries-old classics to newcomers often asked during job interviews at computing, engineering, and financial companies. The puzzles are divided into three groups by their difficulty levels. The first fifty puzzles in the Easier Puzzles section require only middle school mathematics. The sixty puzzle of average difficulty and forty harder puzzles require just high school mathematics plus a few topics such as binary numbers and simple recurrences, which are reviewed in the tutorial. All the puzzles are provided with hints, detailed solutions, and brief comments. The comments deal with the puzzle origins and design or analysis techniques used in the solution. The book should be of interest to puzzle lovers, students and teachers of algorithm courses, and persons expecting to be given puzzles during job interviews.