algorithms data structures de ammeraal leen (18 résultats)

Paperback. Etat : Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less 1.01.

Paperback. Etat : Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less 1.01.

Etat : Good. Used book that is in clean, average condition without any missing pages.

Etat : New. algorithms and data structures in C++ Leendert Ammeraal Hogeschool van Utrecht, The Netherlands C++ is capable of tackling a whole range of programming tasks. The purpose of this book is to give breadth and depth to C++ programmers existing experience of t.

Paperback / softback. Etat : New. New copy - Usually dispatched within 4 working days. 722.

Etat : New. In.

Paperback. Etat : New.

Etat : New. pp. 368.

Taschenbuch. Etat : Neu. Neuware - algorithms and data structures in C++ Leendert Ammeraal Hogeschool van Utrecht, The Netherlands C++ is capable of tackling a whole range of programming tasks. The purpose of this book is to give breadth and depth to C++ programmers existing experience of the language by representing a large number of algorithms, most of them implemented as ready-to-run (and standalone) programs. The programs are as readable as possible without sacrificing too great a degree of efficiency, generality, portability and robustness. Both the classes and programs are designed to demonstrate major programming principles. There is coverage of two key language features - templates and exception handling - apart from which the reader is assumed to have working knowledge of C++. Besides traditional subjects, such as quicksort and binary trees, this book also covers some less well-known topics, including multi-precision arithmetic, route planning and external sorting. Demonstration programs for these and many other exciting applications are based on C++ classes which you can also use in programs of your own.

Like New++ condition; **GREAT FIND**.

Etat : New. pp. 368 1st Edition.

Paperback. Etat : new. Paperback. algorithms and data structures in C++ Leendert Ammeraal Hogeschool van Utrecht, The Netherlands C++ is capable of tackling a whole range of programming tasks. The purpose of this book is to give breadth and depth to C++ programmers' existing experience of the language by representing a large number of algorithms, most of them implemented as ready-to-run (and standalone) programs. The programs are as readable as possible without sacrificing too great a degree of efficiency, generality, portability and robustness. Both the classes and programs are designed to demonstrate major programming principles. There is coverage of two key language features - templates and exception handling - apart from which the reader is assumed to have working knowledge of C++. Besides traditional subjects, such as quicksort and binary trees, this book also covers some less well-known topics, including multi-precision arithmetic, route planning and external sorting. Demonstration programs for these and many other exciting applications are based on C++ classes which you can also use in programs of your own. The aim of this work is to give breadth and depth to the C++ programmer's existing experience of the language. It presents a large number of algorithms, each of them implemented as ready-to-run (and standalone) programs. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Etat : New. 1996. 1st Edition. Paperback. The aim of this work is to give breadth and depth to the C++ programmer's existing experience of the language. It presents a large number of algorithms, each of them implemented as ready-to-run (and standalone) programs. Num Pages: 368 pages, Ill. BIC Classification: UMX; UYA. Category: (P) Professional & Vocational. Dimension: 192 x 236 x 22. Weight in Grams: 670. . . . . .

Etat : New. 1996. 1st Edition. Paperback. The aim of this work is to give breadth and depth to the C++ programmer's existing experience of the language. It presents a large number of algorithms, each of them implemented as ready-to-run (and standalone) programs. Num Pages: 368 pages, Ill. BIC Classification: UMX; UYA. Category: (P) Professional & Vocational. Dimension: 192 x 236 x 22. Weight in Grams: 670. . . . . . Books ship from the US and Ireland.

Paperback. Etat : new. Paperback. algorithms and data structures in C++ Leendert Ammeraal Hogeschool van Utrecht, The Netherlands C++ is capable of tackling a whole range of programming tasks. The purpose of this book is to give breadth and depth to C++ programmers' existing experience of the language by representing a large number of algorithms, most of them implemented as ready-to-run (and standalone) programs. The programs are as readable as possible without sacrificing too great a degree of efficiency, generality, portability and robustness. Both the classes and programs are designed to demonstrate major programming principles. There is coverage of two key language features - templates and exception handling - apart from which the reader is assumed to have working knowledge of C++. Besides traditional subjects, such as quicksort and binary trees, this book also covers some less well-known topics, including multi-precision arithmetic, route planning and external sorting. Demonstration programs for these and many other exciting applications are based on C++ classes which you can also use in programs of your own. The aim of this work is to give breadth and depth to the C++ programmer's existing experience of the language. It presents a large number of algorithms, each of them implemented as ready-to-run (and standalone) programs. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Paperback. Etat : new. Paperback. algorithms and data structures in C++ Leendert Ammeraal Hogeschool van Utrecht, The Netherlands C++ is capable of tackling a whole range of programming tasks. The purpose of this book is to give breadth and depth to C++ programmers' existing experience of the language by representing a large number of algorithms, most of them implemented as ready-to-run (and standalone) programs. The programs are as readable as possible without sacrificing too great a degree of efficiency, generality, portability and robustness. Both the classes and programs are designed to demonstrate major programming principles. There is coverage of two key language features - templates and exception handling - apart from which the reader is assumed to have working knowledge of C++. Besides traditional subjects, such as quicksort and binary trees, this book also covers some less well-known topics, including multi-precision arithmetic, route planning and external sorting. Demonstration programs for these and many other exciting applications are based on C++ classes which you can also use in programs of your own. The aim of this work is to give breadth and depth to the C++ programmer's existing experience of the language. It presents a large number of algorithms, each of them implemented as ready-to-run (and standalone) programs. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Etat : Good. Item in very good condition! Textbooks may not include supplemental items i.e. CDs, access codes etc.

Paperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 722.