ý kiến bạn đọc

The art of Computer Programming : volume 4 : generating all tuples and permutations, fascicle 2

Tác giả: Donald E. Knuth

It discusses the generation of all n-tuples, then extends those ideas to all permutations. Such algorithms provide a natural motivation by means of which many of the key ideas of combinatorial mathematics can be introduced and explored. In this and other fasicles of Volume 4, Knuth illuminates ...

The art of computer programming : volume 4 : bitwise tricks & techniques, binary decision diagrams, fascicle 1

Tác giả: Donald E. Knuth

The author brings together and explains a substantial amount of previously scattered but eminently practical information known only to a few specialists. The book also includes nearly five-hundred exercises for self-study, with detailed answers given in nearly every case; dozens of these exercises ...

The art of computer programming : volume 4 : introduction to combinatorial algorithms and boolean functions, fascicle 0

Tác giả: Donald E. Knuth

This fascicle introduces what will become by far the longest chapter in The Art of Computer Programming, a chapter on combinatorial algorithms that will itself fill three full-sized volumes. Combinatorial algorithms, informally, are techniques for the high-speed manipulation of extremely large ...

Data structures and algorithms in C ++

Tác giả: Adam Drozdek

This text emphasizes the connection between data structures and algorithms; carefully presents the difficult subject of recursion; Offers a case study in every chapter; Introduces the standard template library and intergrates it in the case studies; Provides programming assignments in all but the ...