Turbo algorithms : a programmer's reference

Weiskamp, Keith. ; Namir Clement, 1954- ; Pronk, Ron. [Stephen Kippur, Katherine Schowalter, Ruth Greif

ISBN 10: 0471610097 / ISBN 13: 9780471610090

Edité par New York : Wiley, 1989, 1989

A propos de cet article

[1st ed.], 1st printing ; xxv, 444 p. : ill. ; 24 cm. ; ISBN: 0471610097; 9780471610090; LCCN: 89-31892 ; LC: QA76.7; Dewey: 005.1/3 ; OCLC: 19514560 ; color photographic paper wrappers ; Contents : The Insertion Sort -- Quicksort -- Heap Sort -- The Sorting Implementations -- Searching Techniques -- Mathematical Algorithms -- Turbo Pascal -- Turbo Prolog -- String Processing with Token Strings -- Turbo Prolog -- List Processing with Singly Linked Lists -- List Processing with Doubly Linked and Circular Lists -- Turbo C -- Binary Trees -- AVLTrees -- String Processing with Word Strings. ; FINE. N° de réf. du vendeur 005663

Détails bibliographiques

Titre : Turbo algorithms : a programmer's reference

Éditeur : New York : Wiley, 1989

Date d'édition : 1989

Reliure : Soft cover

Etat : Fine

Edition : 1st Edition

Type de livre : Book

A propos de ce titre

Synopsis :

A companion volume to "Turbo Libraries", this reference gives programmers the tools to write algorithms in all four of Borland's popular Turbo languages - BASIC, C, Pascal, and Prolog. The authors present a systematic method for data processing tasks of searching, sorting lists, stacks, and trees plus standard algorithms in all four Turbo languages. They show how to use each language for specific tasks, such as building your own strings and text manipulation, creating custom routines, and making one language behave like another.