How to Solve it by Computer

Cover......Page __sk_0000.djvu
Copyright......Page __sk_0002.djvu
Contents......Page __sk_0007.djvu
Preface......Page __sk_0011.djvu
Acknowledgements......Page __sk_0019.djvu
1.1 Introduction......Page __sk_0021.djvu
1.2 The Problem-solving Aspect......Page __sk_0023.djvu
1.3 Top-down Design......Page __sk_0027.djvu
1.4 Implementation of Algorithms......Page __sk_0034.djvu
1.5 Program Verification......Page __sk_0039.djvu
1.6 The Efficiency of Algorithms......Page __sk_0049.djvu
1.7 The Analysis of Algorithms......Page __sk_0053.djvu
Bibliography......Page __sk_0059.djvu
Introduction......Page __sk_0062.djvu
2.1 Exchanging the Values of Two Variables......Page __sk_0063.djvu
2.2 Counting......Page __sk_0067.djvu
2.3 Summation of a Set of Numbers......Page __sk_0071.djvu
2.4 Factorial Computation......Page __sk_0076.djvu
2.5 Sine Function Computation......Page __sk_0080.djvu
2.6 Generation of the Fibonacci Sequence......Page __sk_0084.djvu
2.7 Reversing the Digits of an Integer......Page __sk_0089.djvu
2.8 Base Conversion......Page __sk_0094.djvu
2.9 Character to Number Conversion......Page __sk_0100.djvu
Bibliography......Page __sk_0104.djvu
Introduction......Page __sk_0105.djvu
3.1 Finding the Square Root of a Number......Page __sk_0106.djvu
3.2 The Smallest Divisor of an Integer......Page __sk_0112.djvu
3.3 The Greatest Common Divisor of Two Integers......Page __sk_0117.djvu
3.4 Generating Prime Numbers......Page __sk_0125.djvu
3.5 Computing the Prime Factors of an Integer......Page __sk_0136.djvu
3.6 Generation of Pseudo-random Numbers......Page __sk_0140.djvu
3.7 Raising a Number to a Large Power......Page __sk_0144.djvu
3.8 Computing the nth Fibonacci Number......Page __sk_0152.djvu
Bibliography......Page __sk_0158.djvu
Introduction......Page __sk_0159.djvu
4.1 Array Order Reversal......Page __sk_0160.djvu
4.2 Array Counting or Histogramming......Page __sk_0164.djvu
4.3 Finding the Maximum Number in a Set......Page __sk_0167.djvu
4.4 Removal of Duplicates from an Ordered Array......Page __sk_0172.djvu
4.5 Partitioning an Array......Page __sk_0176.djvu
4.6 Finding the kth Smallest Element......Page __sk_0186.djvu
4.7 Longest Monotone Subsequence......Page __sk_0194.djvu
Bibliography......Page __sk_0200.djvu
Introduction......Page __sk_0201.djvu
5.1 The Two-way Merge......Page __sk_0202.djvu
5.2 Sorting by Selection......Page __sk_0212.djvu
5.3 Sorting by Exchange......Page __sk_0218.djvu
5.4 Sorting by Insertion......Page __sk_0224.djvu
5.5 Sorting by Diminishing Increment......Page __sk_0229.djvu
5.6 Sorting by Partitioning......Page __sk_0236.djvu
5.7 Binary Search......Page __sk_0247.djvu
5.8 Hash Searching......Page __sk_0257.djvu
Bibliography......Page __sk_0266.djvu
Introduction......Page __sk_0268.djvu
6.1 Text Line Length Adjustment......Page __sk_0269.djvu
6.2 Left and Right Justification of Text......Page __sk_0276.djvu
6.3 Keyword Searching in Text......Page __sk_0287.djvu
6.4 Text Line Editing......Page __sk_0294.djvu
6.5 Linear Pattern Search......Page __sk_0302.djvu
6.6 Sublinear Pattern Search......Page __sk_0313.djvu
Bibliography......Page __sk_0323.djvu
Introduction......Page __sk_0324.djvu
7.1 Stack Operations......Page __sk_0326.djvu
7.2 Queue Addition and Deletion......Page __sk_0334.djvu
7.3 Linked List Search......Page __sk_0345.djvu
7.4 Linked List Insertion and Deletion......Page __sk_0351.djvu
7.5 Binary Tree Search......Page __sk_0362.djvu
7.6 Binary Tree Insertion and Deletion......Page __sk_0369.djvu
Bibliography......Page __sk_0386.djvu
Introduction......Page __sk_0387.djvu
8.1 Binary Tree Traversal......Page __sk_0393.djvu
8.2 Recursive Quicksort......Page __sk_0403.djvu
8.3 Towers of Hanoi Problem......Page __sk_0411.djvu
8.4 Sample Generation......Page __sk_0424.djvu
8.5 Combination Generation......Page __sk_0434.djvu
8.6 Permutation Generation......Page __sk_0442.djvu
Bibliography......Page __sk_0453.djvu
Index......Page __sk_0455.djvu