How to Solve it by Computer

Algorithm description Algorithm development apply array elements ascii begin binary search binary search algorithm binary tree bubblesort complete match consider current node data set data structure decimal Design an algorithm digits efficient encountered end-of-file established exact divisor examine example exchange extra spaces Fibonacci number finalpole increment initial input insertion sort integer invariant iteration kth smallest kth smallest element left and right left subtree length linear congruential method loop loop invariant mechanism merge method mismatch multiple Notes on design nspaces number of comparisons nxtprime octal originpole output pair partial match Pascal implementation procedure permutation pointer position prime numbers problem-solving queue quicksort random numbers Recursion terminates reversed right partition right subtree search algorithm segment selection sort sequence skip smaller solution solve sorting algorithms square root stack step strategy string Supplementary problems tion variable while-loop word zero