Dec 102017
“C” source code for book “Turbo Algorithms”. | |||
---|---|---|---|
File Name | File Size | Zip Size | Zip Type |
TCALGOL.DOC | 2553 | 1083 | deflated |
TCAQUE.C | 1812 | 651 | deflated |
TCASTACK.C | 1596 | 572 | deflated |
TCAVLTRE.C | 10939 | 2406 | deflated |
TCBTREE.C | 6382 | 1909 | deflated |
TCDLL.C | 7699 | 1474 | deflated |
TCLQUE.C | 2022 | 700 | deflated |
TCLSTACK.C | 1815 | 683 | deflated |
TCMATH.C | 11914 | 3179 | deflated |
TCSEARCH.C | 6253 | 1714 | deflated |
TCSLL.C | 5668 | 1232 | deflated |
TCSORT.C | 6087 | 1899 | deflated |
TCTOKEN.C | 4337 | 1103 | deflated |
TCWORD.C | 9373 | 2173 | deflated |
Download File TALGOL.ZIP Here
Contents of the TCALGOL.DOC file
*********************************************************************
TURBO"C" Source code
from the book:
TURBO
ALGORITHMS
A Programmer's Reference
by Keith Weiskamp, Namir Shammas, Ron Pronk
(Wiley,1989)
(This book also contains the same algorithms
for Turbo -Basic,-Pascal and -Prolog but I did not
include them here).
**********************************************************************
Chapter -1- SORTING TECHNIQUES
Covers insertion sort, shell sort, quicksort, radix sort and heap sort.
Listing 1.2 Turbo C sorting routines - TCSORT.c
-2- SEARCHING TECHNIQUES
Uses arrays and lists as primary data structures to implement searching
algorithms for heuristic, binary,indexed and hash-based searches.
Listing 2.2 Turbo C searching routines - TCSEARCH.c
-3- MATHEMATICAL ALGORITHMS
From transcendental to integration.
Listing 3.2 Turbo C math routines - TCMATH.c
-4- STRING PROCESSING WITH WORD STRINGS
How to design and code a useful set of string processing routines.
Listing 4.2 Turbo C Word string library - TCWORD.c
-5- STRING PROCESSING WITH TOKEN STRINGS
Expands on material in chapter 4.
Listing 5.2 Turbo C Token string library - TCTOKEN.c
-6- LIST PROCESSING with SINGLY LINKED LISTS
Covers the use of pointers, records and structures in working with
singly linked lists.
Listimg 6.4 Turbo C singly linked list processing functions -TCSLL.c
-7- LIST PROCESSING with DOUBLY LINKED and CIRCULAR LISTS
Expands on material in chapter 6.
Listing 7.4 Turbo C doubly linked and circular list processing routines - TCDLL.c
-8- STACKS and QUEUES
Shows how to implement and process stacks and queues.
Listing 8.3 Turbo C for array-based Stacks - TCASTACK.c
Listing 8.4 Turbo C for linked list-based Stacks - TCLSTACK.c
Listing 8.5 Turbo C for array-based Queues - TCAQUE.c
Listing 8.6 Turbo C for linked list-based Queues - TCLQUE.c
-9- BINARY TREES
Presents techniques for representing and processing binary trees.
Listing 9.2 Turbo C for binary tree library - TCBTREE.c
-10- AVL TREES
Presents algorithms for adding elements, deleting elements, searching for
elements and balancing AVL trees.
Listing 10.1 Turbo C for AVL-tree library - TCAVLTRE.c
NOTE: Those programmer's who are interested in a more in depth discussion of
these algorithms should see the book:
2nd edition - "DATA STRUCTURES and PROGRAM DESIGN" by Robert L. Kruse
(Prentice-Hall,1987)
TURBO"C" Source code
from the book:
TURBO
ALGORITHMS
A Programmer's Reference
by Keith Weiskamp, Namir Shammas, Ron Pronk
(Wiley,1989)
(This book also contains the same algorithms
for Turbo -Basic,-Pascal and -Prolog but I did not
include them here).
**********************************************************************
Chapter -1- SORTING TECHNIQUES
Covers insertion sort, shell sort, quicksort, radix sort and heap sort.
Listing 1.2 Turbo C sorting routines - TCSORT.c
-2- SEARCHING TECHNIQUES
Uses arrays and lists as primary data structures to implement searching
algorithms for heuristic, binary,indexed and hash-based searches.
Listing 2.2 Turbo C searching routines - TCSEARCH.c
-3- MATHEMATICAL ALGORITHMS
From transcendental to integration.
Listing 3.2 Turbo C math routines - TCMATH.c
-4- STRING PROCESSING WITH WORD STRINGS
How to design and code a useful set of string processing routines.
Listing 4.2 Turbo C Word string library - TCWORD.c
-5- STRING PROCESSING WITH TOKEN STRINGS
Expands on material in chapter 4.
Listing 5.2 Turbo C Token string library - TCTOKEN.c
-6- LIST PROCESSING with SINGLY LINKED LISTS
Covers the use of pointers, records and structures in working with
singly linked lists.
Listimg 6.4 Turbo C singly linked list processing functions -TCSLL.c
-7- LIST PROCESSING with DOUBLY LINKED and CIRCULAR LISTS
Expands on material in chapter 6.
Listing 7.4 Turbo C doubly linked and circular list processing routines - TCDLL.c
-8- STACKS and QUEUES
Shows how to implement and process stacks and queues.
Listing 8.3 Turbo C for array-based Stacks - TCASTACK.c
Listing 8.4 Turbo C for linked list-based Stacks - TCLSTACK.c
Listing 8.5 Turbo C for array-based Queues - TCAQUE.c
Listing 8.6 Turbo C for linked list-based Queues - TCLQUE.c
-9- BINARY TREES
Presents techniques for representing and processing binary trees.
Listing 9.2 Turbo C for binary tree library - TCBTREE.c
-10- AVL TREES
Presents algorithms for adding elements, deleting elements, searching for
elements and balancing AVL trees.
Listing 10.1 Turbo C for AVL-tree library - TCAVLTRE.c
NOTE: Those programmer's who are interested in a more in depth discussion of
these algorithms should see the book:
2nd edition - "DATA STRUCTURES and PROGRAM DESIGN" by Robert L. Kruse
(Prentice-Hall,1987)
December 10, 2017
Add comments