Free Shipping In Australia
Data Structures & Algorithms C++ By Glenn Rowe

Data Structures & Algorithms C++
by Glenn Rowe

A complete introduction to the topic of data structures and algorithms, approached from an object-oriented perspective, using C++. All data structures are described, including stacks, queues, sets, linked lists, trees and graphs. Searching and sorting algorithms are also studied.

Only 1 left

Data Structures & Algorithms C++ Summary

This book presents the fundamentals of data structures from an object oriented perspective. The text uses C++, whose classes and object oriented constructs are specifically designed to efficiently implement data structures. The opening chapters introduce the ideas behind OOP and C++ and once the principles are explained, the book develops to deal with data structures and algorithms fom an OO point of view. All the standard data structures are described, including stacks, queues, sets, linked lists, trees and graphs. In addition to the algorithms dealing with these data structures, searching and sorting algorithms are also studied. A non-mathematical approach is adopted for the study of algorithm efficiency. Rather than derive analytic expressions for the number of steps taken by various alorithms, programs are written which count the number of steps and draw graphs of these numbers as functions of the size of the data sets being processed. The Graphs are then transformed to obtain the orders of the algorithms.

Why buy from World of Books

Our excellent value books literally don't cost the earth
Free delivery in Australia
Read more here
Every used book bought is one saved from landfill

Additional information

Data Structures & Algorithms C++
Glenn Rowe
Used - Very Good
Pearson Education (US)
Book picture is for illustrative purposes only, actual binding, cover or edition may vary.
This is a used book - there is no escaping the fact it has been read by someone else and it will show signs of wear and previous use. Overall we expect it to be in very good condition, but if you are not entirely satisfied please get in touch with us.