Yahoo Search Búsqueda en la Web

Resultado de búsqueda

  1. A free electronic version of a self-published textbook on algorithms, along with other lecture notes for theoretical computer science classes at Illinois. The book covers basic and advanced topics, such as recursion, dynamic programming, greedy algorithms, graph algorithms, NP-hardness, and more.

    • CS 173

      Textbook. The official course text is Building Blocks for...

    • Spring 2018

      Please let Jeff know if you find any of the bugs we've...

  2. jeffe.cs.illinois.edu › teaching › algorithmsJeff Erickson

    Jeff Erickson

  3. ‪Professor of Computer Science, University of Illinois Urbana-Champaign‬ - ‪‪Cited by 6,300‬‬ - ‪Algorithms‬ - ‪data structures‬ - ‪computational geometry‬ - ‪computational topology‬

  4. jeffe.web.engr.illinois.edu › teaching › algorithmsAlgorithms

    • 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

  5. 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...

  6. 1 de dic. de 2013 · A textbook on algorithms by Jeff Erickson, a professor at the University of Illinois at Urbana-Champaign. Read 7 reviews from readers who rated the book 4.51 out of 5 and shared their opinions on the book's content, style, and examples.