Programming PearlsThe essays in this book present programs that go beyond solid engineering techniques to be creative and clever solutions to computer problems. The programs are fun and teach important programming tecniques and fundamental design principles. |
Contents
PRELIMINARIES | 1 |
Aha Algorithms | 11 |
Data Structures Programs | 23 |
Copyright | |
12 other sections not shown
Other editions - View all
Common terms and phrases
algorithm design anagram applications array assertion back-of-the-envelope BASIC binary search binary search algorithm bitmap bits Brian Kernighan bytes calculations COBOL code tuning contains correct cost data structure database describes dictionary digits disk efficient element encoding error ExtractMin factor faster FORTRAN function gram hash heap property Heapsort implementation initialize input file Insertion Sort integers invariant Kernighan kilobytes language lines of code loop loop invariant main memory maximum MaxSoFar McIlroy McIlroy's minutes MustBe L,U N-element node O(log O(N log O(Nē operations output partitioning percent personal computer priority queues procedure program verification Programming Pearls pseudocode QSort Quicksort random range recursive represent routine scheme Section sequence sequential search shows SiftDown signature simple Solutions for Column solve space sparse matrix speedup spelling checker statement subroutine subvector Swap tape techniques terminal tion tree UNIX vector words write zero