Librería Samer Atenea
Kálamo Books
Librería Elías (Asturias)
Librería Kolima (Madrid)
Librería Proteo (Málaga)
Stop memorizing array solutions. Start seeing why they work.Arrays - Volume 1 - C++ Edition teaches 56 array algorithms through plain-language explanations, C++ implementations, and step-by-step visual walkthroughs. Every algorithm is printed in clear grayscale, so pointers, windows, and changing values stand apart at a glance and are easy to trace. Before the first algorithm, four hands-on primers - off-by-one errors, loop patterns, two pointers, and sliding windows - build the habits every array problem depends on.Watch two pointers converge from both ends of an array. Follow a sliding window as it grows and shrinks. See a running sum reveal a balance point, and track the single piece of state that turns a linear scan into an optimal answer. Instead of holding every changing index in your head, follow the execution on the page.The visual walkthroughs use small multiples, a data visualization technique that presents successive stages of an algorithm as a series of consistently structured diagrams-all on one page. By seeing the complete algorithm change from input to result at once, you can compare states, follow what moves, and understand how each decision affects the next. This brings the algorithm to life, reinforcing understanding and helping the underlying patterns and mechanics stay with you longer.Every main algorithm is presented in three complementary parts:Understanding & Reasoning: Learn the goal, key idea, edge cases, and time and space complexity before studying the implementation.Inspect & Debug: Examine C++ code alongside an AI-Era Interview Lens that challenges you to question assumptions, recognize plausible mistakes, and explain why a solution is correct.Trace & Walkthrough: Follow the input through intermediate states to the result, with visual explanations of the decisions that matter.The six pattern families cover Two Pointers, Partitioning & Pair Problems; Sliding Windows & Window-Based Counting; Prefix Sums, Balance Points & Subarray Sums; Linear Scans & Running-State Optimization; Search in Ordered & Structured Arrays; and Merging, Intervals & Sorted-Array Operations. Problems include Water Container, Maximum of All Subarrays of Size K, Subarray with Zero Sum, Maximum Product Subarray, Median of Two Sorted Arrays, and Merge Overlapping Intervals.Two AI-Era Interview Challenges - Maximum Subarray Sum and Rotate Matrix - ask you to review AI-generated C++ code, find a subtle bug, and prove the corrected version handles every edge case. A ten-stage essay, A Deeper Understanding of Algorithms Over Time, maps how algorithmic thinking matures, from 'every problem looks different' to a reusable framework for new problems.The book documents its verification process, including real-toolchain compilation and execution, tests beyond the printed examples, memory checks with real memory-analysis tooling, and checks that explanations agree with the code.Designed for readers with basic C++ knowledge who want to strengthen interview preparation, debugging, and algorithmic reasoning.This is Volume 1 of the three-volume C++ Arrays collection. All 56 of its algorithms and its four primers are also included in Arrays - Complete Edition - C++ Edition.