SØG - mellem flere end 8 millioner bøger:
Viser: Data Structures and Algorithms in C++ - Pocket Primer
Data Structures and Algorithms in C++: Pocket Primer Vital Source e-bog
Lee Wittenberg
(2017)
Data Structures and Algorithms in C++: Pocket Primer Vital Source e-bog
Lee Wittenberg
(2017)
Data Structures and Algorithms in C++: Pocket Primer Vital Source e-bog
Lee Wittenberg
(2017)
Data Structures and Algorithms in C++
Pocket Primer
Lee Wittenberg
(2017)
Sprog: Engelsk
om ca. 10 hverdage
Detaljer om varen
- Vital Source searchable e-book (Reflowable pages)
- Udgiver: Stylus Publishing LLC (Marts 2017)
- ISBN: 9781683920854
Features
• Takes a “minimalist” approach to the material that presents only essential concepts. This enables readers to focus on (and remember) just what they’ll need.
• Uses select features of the C++11 standard to simplify the sample code and make it easier to understand.
• Connects the concepts directly to the classes provided the Standard Template Library (STL), and shows how these classes can be implemented in C++.
• Uses “literate programming” techniques that allow the presentation of the sample code to more clearly show the details of the code as well as how the pieces fit together.
Bookshelf online: 5 år fra købsdato.
Bookshelf appen: ubegrænset dage fra købsdato.
Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)
Detaljer om varen
- Vital Source 180 day rentals (dynamic pages)
- Udgiver: Stylus Publishing LLC (Marts 2017)
- ISBN: 9781683920854R180
Features
• Takes a “minimalist” approach to the material that presents only essential concepts. This enables readers to focus on (and remember) just what they’ll need.
• Uses select features of the C++11 standard to simplify the sample code and make it easier to understand.
• Connects the concepts directly to the classes provided the Standard Template Library (STL), and shows how these classes can be implemented in C++.
• Uses “literate programming” techniques that allow the presentation of the sample code to more clearly show the details of the code as well as how the pieces fit together.
Bookshelf online: 180 dage fra købsdato.
Bookshelf appen: 180 dage fra købsdato.
Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)
Detaljer om varen
- Vital Source 90 day rentals (dynamic pages)
- Udgiver: Stylus Publishing LLC (Marts 2017)
- ISBN: 9781683920854R90
Features
• Takes a “minimalist” approach to the material that presents only essential concepts. This enables readers to focus on (and remember) just what they’ll need.
• Uses select features of the C++11 standard to simplify the sample code and make it easier to understand.
• Connects the concepts directly to the classes provided the Standard Template Library (STL), and shows how these classes can be implemented in C++.
• Uses “literate programming” techniques that allow the presentation of the sample code to more clearly show the details of the code as well as how the pieces fit together.
Bookshelf online: 90 dage fra købsdato.
Bookshelf appen: 90 dage fra købsdato.
Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)
Detaljer om varen
- Paperback: 200 sider
- Udgiver: Mercury Learning & Information (April 2017)
- ISBN: 9781683920847
Features
- Takes a "minimalist" approach to the material that presents only essential concepts. This enables readers to focus on (and remember) just what they'll need.
- Uses select features of the C++11 standard to simplify the sample code and make it easier to understand.
- Connects the concepts directly to the classes provided the Standard Template Library (STL), and shows how these classes can be implemented in C++.
- Uses "literate programming" techniques that allow the presentation of the sample code to more clearly show the details of the code as well as how the pieces fit together.
2: Algorithm Analysis.
3: Linked Lists.
4: Stacks and Queues.
5: Recursion.
6: Binary Trees.
7. Binary Trees (Continued)
8: Sorting.
9: Hash Tables.
10. Graphs Appendices: A. Programmer's Library. B. STL Class Summary. C. Chunk Index. Index.