Ready-to-Run Visual Basic(r) Algorithms, 2nd Edition - Softcover

Stephens, Rod

Softcover

ISBN 10: 0471242683 ISBN 13: 9780471242680

Publisher: Wiley, 1998

Synopsis

All the Visual Basic algorithms you'll ever need and how to use them

This book/CD package arms you with a library of powerful algorithms completely implemented in Visual Basic source code. Just as importantly, it shows you how, when, and where to use them . . . or not to use them. It covers classic VB algorithms as well as the latest VB object-oriented techniques for handling just about any design requirement you'll encounter, such as managing data structures, sorting, searching, hashing, networking, and other important program functions.

In plain English, and with the help of sample code and scads of working examples, VB expert Rod Stephens explains how algorithms work and:
* Describes techniques for selecting the best ones for your projects
* Tutors you in methods for analyzing how they will perform in your programs
* Acquaints you with programming techniques for solving problems as they arise
* Supplies algorithms for most programming situations
* Covers new object-oriented VB algorithms-how they work and how to use them
* Introduces new concepts and techniques for programming in multiple versions of VB.

The CD-ROM supplies you with:
* Source code for all the algorithms described
* Test programs to try them out
* Examples and tests to help you gauge and fine-tune your skills.

Visit our website at www.wiley.com/compbooks/

Visit the author's comprehensive Visual Basic site at:.www.vb-helper.com

About this title

Review

This guide shows how to extend Visual Basic (VB) with code that handles some advanced programming problems, including algorithms that you can use every day to write faster and more flexible VB applications. After an introductory discussion of profiling algorithms and some techniques to emulate pointers in VB, the author shows how to emulate a variety of data structures, such as linked lists, stacks and queues, and arrays, along with their implementations in VB.

Besides these basic container types, the author also proceeds farther afield into a demonstration of trees in VB, including balanced trees. (Though you won't need these data structures for most programs, it's interesting to see how they can be written in VB.)

More applicable to real-world problems are the sections on sorting, searching, and hashing in VB. (These algorithms can extend the range of the types of problems VB can solve.) This book closes with some network algorithms and some discussion of object-oriented techniques for VB, including some "patterns" or reusable designs for software. With the accompanying CD-ROM, you can use all the author's algorithms or write your own based on the techniques explored here. --Richard Dragan

From the Publisher

Since the publication of the first edition of this well-received book, several new easier-to-use versions of VB have been released and object-oriented algorithms have become a reality. This new edition brings a popular book up to speed with these developments. It describes a large set of algorithms important to a variety of programming situations. Each algorithm is described in detail and is accompanied by implementation code and working examples. The new topics include new algorithm concepts and techniques for VB 4.0 and 5.0, new object-oriented VB algorithms, and a library of ready-to-run code implementing the most important algorithms. Includes CD-ROM with... * Source code for all algorithms in the book. * Test programs for using the algorithms. * One or more large databases for use with the programs. * U.S. highway system network to use with the network algorithms. * Examples and tests for training and college market.

Edition details

• Publisher: Wiley
• Publication date: 1998
• ISBN 10: 0471242683
• ISBN 13: 9780471242680
• Binding: Paperback
• Language: English
• Edition number: 2
• Number of pages: 416