[About]  >>  Preview  >>  Purchase  >>  Source Code Download  >>  IDE Setup  >>  Contact  >>  Additional Resources

About Volume 1
View cover

From databases and operating systems to simulations and graphics, data structures are an integral part of all programming domains. Designed for complete beginners as well as those with prior programming experience, C++ Data Structures from Scratch, Vol. 1 covers everything from basic C++ language concepts to creating fully functional, STL-style implementations of common data structures and sorting algorithms.

Key features:

• 170+ complete source code files, with detailed line-by-line analysis and diagrams


• 60 sample programs directly illustrating key concepts from each chapter


• Free sample content and online support

Major topics:

• Step-by-step instructions for setting up an IDE (integrated development environment)


• Thorough coverage of fundamental C++ language concepts:
  
  
  • Datatypes, variables, and arithmetic
  • Logic, functions, and program structure
  • Pointers, arrays, and references
  • Object-oriented programming (classes) and operator overloading
  • Template metaprogramming, in the style of the Standard Template Library (STL)
  • Dynamic memory allocation


• A comprehensive, line-by-line guide to implementing:
  
  
  • Bubble sort, insertion sort, and quick sort
  • Allocators
  • Dynamic arrays (STL vector)
  • Doubly-linked lists (STL list)
  • Single-block deques (double-ended queues)
  • Multi-block deques (STL deque)
  • Unbalanced binary search trees
  • AVL trees (STL map)
  • Bidirectional / random access, const, and reverse iterators for each data structure

Cover illustration: SelfSimilarCircuitry by Mark J. Brady (markjaybeefractal.com)

Back to top

About Volume 2
View cover

Building upon the first book in the series, C++ Data Structures from Scratch, Vol. 2 is a comprehensive guide to creating fully functional, STL-style implementations of more advanced data structures and algorithms, introducing new and powerful C++ language concepts along the way.

Key features:

• 160+ complete source code files, with detailed line-by-line analysis and diagrams


• 40+ sample programs directly illustrating key concepts from each chapter


• Free sample content and online support

Major topics:

• Heaps (STL priority_queue, make_heap, push_heap, pop_heap)


• Heap sort
• Selection sort
• Shell sort
• Merge sort
• Binary search


• B-trees
• Red-black trees (STL map)
• Skip lists


• Inheritance and polymorphism
• Smart pointers (STL shared_ptr)


• Singly-linked lists (STL forward_list)
• Binary representation and bitwise operations
• FNV hash
• Hash tables (STL unordered_map)

Cover illustration: IteratedConduits by Mark J. Brady (markjaybeefractal.com)

Back to top

About the Author

Robert MacGregor is the developer of a C++ API for financial market trading systems. He is also a CTA (Commodity Trading Advisor) in the National Futures Association, and a CMT (Chartered Market Technician) in the Market Technicians Association.

Back to Top

Preview >>