内容简介

....The most comprehensive guide to designing practical and efficient algorithms....

Written by a well-known algorithms researcher who received the IEEE Computer Science and Engineering Teaching Award, this new edition of The Algorithm Design Manual is an essential learning tool for students needing a solid grounding in algorithms, as well as a special text/reference for professionals who need an authoritative and insightful guide. Professor Skiena is also author of the popular Springer text, Programming Challenges: The Programming Contest Training Manual.

作者简介

Steven Skiena (1961-, http://www.cs.sunysb.edu/~skiena/) is a Professor of Computer Science in State University of New York at Stony Brook

精彩摘录

Typicalcomputersciencestudentsstudythebasicsortingalgorithmsatleastthreetimesbeforetheygraduate:firstinintroductoryprogramming,thenindatastructures,andfinallyintheiralgorithmscourse.

——引自第101页

Whenyouhavemorethan100itemstosort,itisimportanttouseanO(nlgn)-timealgorithmlikeheapsort,quicksort,ormergesort....Onceyougetpast(say)5,000,000items,itisimportanttostartthinkingaboutexternal-memorysortingalgorithmsthatminimizediskaccess.

——引自第436页