sedgewick w a (14 risultati)

71pp. 1st ed., fine in orange card covers. Detailed description of these experimental postmarks.

30pp + 19 plates. 1st ed., clean in card covers. Guide to the skeleton postmarks.

67pp + 5 plates. 1st ltd. ed. of 250 copies, clean in card covers.

81 large pp. 2nd revised ed., clean in green card covers.

99pp + 29 plates. 1st ltd. ed., of 250 copies. Fine in original pink card covers.

78pp + 15 plates. 1st ltd. ed. of 250 copies, clean in card covers.

139 + 4pp + 28 plates. 1st ltd. ed., of 300 copies. Fine in original green card covers. Signed by the authors.

Stapled Pamphlet. Condizione: Good. First Edition. Invaluable reference/history for the postal historian/philatelist. First Edn., 1974; printed orange card covers; iv+68pp.; illus. bw. repros. Spine very slightly faded; faintly soiled/lightly foxed covers slightly creased at corners, but bright; pages very lightly creased at top corners, but pages clean/bright; staples clean, binding secure. No inscriptions. Lightweight item, hence overseas customers will have SHIPPING CHARGES REDUCED subsequent to ordering. Good. PRICE INCLUDES UK POSTAGE & PACKING. Softcover.

paperback. Condizione: New. Paperback. Pub Date: 2006 09 of Pages: 482 in Publisher: China Machine Press book is the Sedgewick thoroughly revised and rewritten Books. centralized explain the graph algorithms. A total of six book chapters (chapters 17-22). Figures nature and type discussed in detail in Chapter 17. Chapter 18-22 explain graph search to map and DAG. minimum spanning tree. shortest path and network flow. The book provides a C language description of the complete algorithm source code. and with rich illustra.

Pamphlet. Condizione: Good. Type: Book 71pp.n.d.

paperback. Condizione: New. Paperback. Pub Date: 2006 Pages: 702 in Publisher: China Machine Press book is the first book of the series Sedgewick thoroughly revised and rewritten C algorithm. The book is divided into four parts and 16 chapters. The first part of the basics (1 to 2) introduced the basic principle of algorithm analysis. The second part of the data structure (3-5). Explain the data structures algorithm analysis must master knowledge. including basic data structures. abstract data structures. recursion and .

paperback. Condizione: New. Paperback Pages Number: 537 Language: Chinese. C algorithm (Volume 1): basic data structures. sorting. and explore the most important computer algorithms designed to Summary of today's programmers use. as well as more and more to learn these algorithms to explain the basic technology. the C algorithm (Volume 1): basic data structures. sorting. and explore can be used as a learning computer science second. third or fourth course textbook for those who have mastered the basic programming skills.

paperback. Condizione: New. Paperback Pages Number: 532 Language: Chinese. I-IV algorithm underlying data structure sort and search for (3rd edition) covers basic data structures. sorting algorithms. search algorithms and their applications. Including the expansion of the introduction of arrays. linked lists. string tree. and other basic data structures; quantitative analysis on the algorithm. Robert Sedgewick completely rewritten his book. it is fully expanded and updated to cover the important algorithms and data stru.

paperback. Condizione: New. Paperback Pages Number: 955 Language: English. Turing original Computer Science Series: Algorithm (English Edition) No. 4 as the algorithm field of a classic reference book fully describes the essential knowledge about algorithms and data structures. and especially for sorting. searching. mapping processing and string manipulation are discussed. 4 given the 50 algorithms every programmer should be aware that should provide the actual code and the Java code uses a modular programming style. th.