The 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.
9 pages matching partitioning in this book
Results 1-3 of 9
What people are saying - Write a review
We haven't found any reviews in the usual places.
Cracking the Oyster
Data Structures Programs
Writing Correct Programs
12 other sections not shown
Other editions - View all
0(N log algorithm design anagram applications assertion back-of-the-envelope BASIC binary search binary search algorithm bitmap bits Brian Kernighan bytes CACM calculations character COBOL code tuning contains correct cost data structure database describes dictionary digits disk efficient element encoding error factor faster FORTRAN function gram hash heap property Heapsort implementation initialize input Insertion Sort integers invariant Kernighan kilobytes Knuth's language lines of code log2 loop loop invariant main memory maximum Mcllroy Mcllroy's minutes node operations output partitioning percent performance personal computer priority queues procedure program verification Programming Pearls pseudocode Quicksort random range recursive reduced the run represent routine scheme Section sequence sequential search shows signature simple Solutions for Column solve space sparse matrix speedup spelling checker statement subarray subroutine subvector Swap tape techniques terminal tion tree UNIX vector words write zero