Animated Algorithms: A Self-teaching Course in Data Structures and Fundamental AlgorithmsMcGraw-Hill, 1986 - 279 Seiten This book contains the traditional topics of a first 'serious' course in computer science--for users without a computer science background. No advanced knowledge is needed to understand this text, with over 20 ready-to-run BASIC programs follow the progress of algorithms and data structures. Topics are developed through successive chapters, using an integrated methodology. The sample programs provide easily adapted code for implementing algorithms and graphically demonstrate in easily followable steps algorithm and data structure processes. Activities to master these techniques are included in each chapter. |
Inhalt
Some Simple Sorting Processes | 1 |
Looking for a Match | 49 |
Working with Linked Lists | 95 |
Urheberrecht | |
3 weitere Abschnitte werden nicht angezeigt.
Häufige Begriffe und Wortgruppen
alphabetic order array binary tree bubble sort character COLOR comparand compared contains coordinates current attention cursor position cycle de-highlight deleted doubly linked list draw element empty entry erase ERROR GOTO error trap free space GOSUB graph highlight horizontal I=1 TO IMAX infix expression input expression insertion sort ith node jump key press left child LINKADD LINKDEL linked list LOCATE loop through nodes merge message area move output file parent path length pivot pixel postfix postorder traversal precedence Press space bar press the space program prompts push Q to quit queue quicksort record redisplay response RETURN right child root node screen search key selection sort shortest path sort algorithm stack starting node statements string structure table sublist subroutine Suggested Activities swap switch tail tie line traversal vertical wait for key WEND loop Write a program