Algorithms and data structure with Ada, C++ and Java
This book on data structures and algorithmes has a unique feature: it gives the reader the opportunity to compare the implementations of algorithms by three distinct programming languages, namely Ada, C++ and Java. It is clearly not possible to give introductions to three very different programming languages within one book, so some experience with at least one programming language and simple programs using subroutines and loops is required. There is however a short introduction into object oriented concepts in the first chapter, which develops and motivates the concept of abstract data types and algorithms, and how to realize them with a programming language. The Big-\(O\)-Notation for (time-)complexity of algorithms is introduced and used throughout the book to measure efficiency. NEWLINENEWLINENEWLINEWhile the second chapter is concerned with recursive and iterative programs (Hilbert's space filling curve serves as one example), each of the next six chapters is devoted to one group of standard data structures or problems: sorting from bubble sort to heap sort, linear structures from lists to queues, trees, graphs -- weighted or directed --, tables with binary search or hashing, and AVL-trees and B-trees. In all cases the data structures and operations on them are clearly defined. The implementations are given in pseudo-code before in three separate sections the complete, fully commented code for Ada, C++ and Java respectively is exhibited. Explanations are very detailed, especially for operations on graphs. NEWLINENEWLINENEWLINEEach chapter has some exercises without solutions. In an appendix a graphics library for turtle graphics is made available. All source files and packages are available online.
This page was built for publication: Algorithms and data structure with Ada, C++ and Java
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2778910)
