Algorithm Contest Entry Classic (6 results)

Paperback. Condition: Very Good. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Condition: good. Supports Goodwill of Silicon Valley job training programs. The cover and pages are in Good condition! Any other included accessories are also in Good condition showing use. Use can include some highlighting and writing, page and cover creases as well as other types visible wear.

paperback. Condition: New. Language:Chinese.Paperback. Publisher: Tsinghua University.

paperback. Condition: New. Paperback. Pub Date :2014-05-01 Pages: 488 Language: Chinese Publisher: Tsinghua University Press algorithm contest entry classic (2nd Edition) is an algorithm contest entry and improve teaching. the CC + + languages. algorithms and solving problems together organically. dilution theory. focusing on learning and practical skills. The book is divided into 12 chapters. including program design entry. programming loop structures. arrays and strings. functions and recursion. C + + and STL entry. .

paperback. Condition: New. Paperback. Pub Date: 2012 Publisher: Tsinghua University Press algorithm contest entry classic: Training Guide is a the algorithm contest entry classic important supplement. designed to complement the original book is not involved or explain enough detail . in order to build a more complete knowledge of the system. and with a large number of specific topics. so abstract and complex algorithms and mathematical concrete. practical. The book of six chapters. by nearly 200 examples were the basis.

paperback. Condition: New. Pub Date: 2013-06-01 Language: Chinese Publisher: Machinery Industry Press' college programming courses and competitions training materials: algorithm design programming experiment knowledge architecture. ways of thinking and problem-solving strategies as the main line. sub-eight chapters were Introduction AdHoc. simulation. number theory. portfolio analysis. greedy. dynamic programming methods. advanced data structures. computational geometry programming experiments. Each section of the test.