## How to solve it by computer |

### What people are saying - Write a review

User Review - Flag as inappropriate

A MUST read for all Computer Science Students.

The Author explains about basic problem solving

techniques like searching & sorting and others.Very helpful & useful book.

### Contents

Bibliography | 39 |

2 Counting | 47 |

4 Factorial Computation | 56 |

Copyright | |

32 other sections not shown

### Other editions - View all

### Common terms and phrases

Algorithm description Algorithm development apply begin binary search binary search algorithm character column values column[k consider current column current node data set data structure deleted node Design an algorithm Design and implement digits disks efficient end end end Notes end-of-file Establish example exchange Fibonacci number finalpole front initial input insertion and deletion insertion sort integer iteration kth smallest element left and right left partition left subtree leftmost node linear linked list listhead loop mechanism mismatch nelements node pointer Notes on design ordered binary tree ordered linked list originpole output partial match pattern permutation position postorder traversal previous node prime printed queue quicksort rear Recursion terminates recursive algorithm recursive call right partition right subtree search algorithm segment sequence smallest solution solve sorted sorting algorithms sparepole stack step Supplementary problems termination tion Towers of Hanoi tree search algorithm tree traversal variable word