Resultado de búsqueda
This web page contains a free electronic version of my self-published textbook Algorithms, along with other lecture notes I have written for various theoretical computer science classes at the University of Illinois, Urbana-Champaign since 1998.
Jeff Erickson
My book and lecture notes are currently used in two regularly-offered courses, which became official in 2015. CS/ECE 374 is a mixed course on algorithms and models of computation, required for all undergraduate computer science and computer engineering majors.
Professor of Computer Science, University of Illinois Urbana-Champaign - Cited by 6,300 - Algorithms - data structures - computational geometry - computational topology
• Fundamental algorithms: elementary algorism, sequential search, binary search, sorting (selection, insertion, merge, heap, quick, radix, and so on), breadth- and depth-first search in (at least binary) trees, and most
This textbook is a wide-ranging, idiosyncratic treatise on the design and analysis of algorithms, covering several fundamental techniques, with an emphasis on intuition and the problem-solving...
1 de dic. de 2013 · Great book on algorithms. Assumes you know basic data structures before you dive in. Compared to the standard to which all algorithm books are measured, Introduction to Algorithms (aka CLRS), Erickson's book focuses more on explaining the intuition behind the algorithms.
