Advanced Programming Techniques by Barzee, Rex A. -- Read -- Imperial Library of Trantor

Index

Title Page Contents Page List Preface

Who Should Read This Book? How to Use This Book Acknowledgements Review This Book

Chapter 1. Arrays

1.1 Fill an Array 1.2 Initialize an Array to a Ramp 1.3 Reverse an Array 1.4 Rotate an Array 1.5 Linear Search 1.6 Binary Search 1.7 Find a Range 1.8 Table Based Solutions 1.9 Roman Numerals 1.10 Sort an Array 1.12 Possible User Input 1.13 Predictive User Input 1.14 Programming Exercises

Chapter 2. Array Lists

2.1 Initial Capacity and Quantum 2.2 Fibonacci Variable Quantum 2.3 Memory Efficient StringBuilder 2.4 Programming Exercises

Chapter 3. Linked Lists

3.1 Inefficient Node Centric Lists 3.2 Dummy Node 3.3 Elegant and Efficient Pointer Centric Lists 3.4 Other Data Structures with Pointers 3.5 Doubly Linked List 3.6 Linked List Comparison 3.7 Programming Exercises

Chapter 4. Iteration and Recursion

4.1 Iteration 4.2 Recursion 4.3 Advantages of Recursion 4.4 Disadvantages of Recursion 4.5 Tail Recursion 4.6 Recursion to Iteration 4.7 Binary Tree 4.8 Fibonacci Series 4.9 Files and Directories 4.10 Iteration to Recursion 4.11 Future Value 4.12 Conclusions

Chapter 5. Counting Bits

5.1 Bitwise Operators 5.2 Naive Bit Counting 5.3 Improved Loop Termination 5.4 Addition Instead of If 5.5 Skip Zero Bits 5.6 Combinatorial Algorithm 5.7 Look Up Table 5.8 Algorithm Comparison

Chapter 6. Sets

6.1 Unsorted Sets 6.2 Sorted Sets 6.3 Bit Sets

Chapter 7. Statistics

7.1 Minimum 7.2 Summation 7.3 Mean 7.4 Variance 7.5 Correlation 7.6 Numerical Stability 7.7 Multiple Statistics at Once 7.8 Programming Exercises

Appendix A. Writing Robust Code Appendix B. Answers to Desk Checks

Chapter 1 Chapter 2 Chapter 4 Chapter 5 Chapter 6 Chapter 7

Index About the Author