A clear and concise introduction to the C programming language, focusing on those features of C not available in other languages. Includes a complete explanation of the language and numerous programs -- providing valuable instruction not only in learning C but also in understanding real applications. Includes an elegant and efficient sorting method for files, known as a natural merge sort, as well as a program for binary file search which demonstrates how to update a file with direct access.
Turbo C version 2.0 from Borland International offers an extensive set of graphics routines, and attention has now shifted from developing basic graphics tools towards using the wide range of tools available. This book allows readers to take advantage of Turbo C by providing illustrated examples of graphics applications, ranging from a simple triangle to a complete interactive drawing program. Provides details of fundamental Turbo C functions; the aspect ratio, circles, arcs, and lines of any width; how to obtain graphics results that can be incorporated into text documents, as well as the use of the Hewlett-Packard Graphic Language, especially in connection with desktop publishing; and the Turbo C funcions associated with viewports and stored images. Also shows how to get input data from a mouse for developing a mouse-controlled drawing program (MSDRAW), including the complete source text.
Most books on data structures are based on Pascal. With increased use of C, however, advanced programming techniques including dynamic data structures are found to be more practical and efficient in this language. By using the C language throughout, the author is able to discuss and demonstrate random file access in sorting programs and in programs that manipulate B-trees. The book focusses on useful applications such as storing and retrieving large amounts of data efficiently, and the critical-path method in project planning.
Die Programmiersprache C erlaubt den Einsatz fortgeschrittener dynamischer Datenstrukturen, so daß der Autor im Verlauf des Buches den wahlfreien Zugriff in Sortierprogrammen und in Programmen zur Manipulation von B-Bäumen zeigen kann. Der Leser findet im Buch sowohl rein theoretische Abhandlungen als auch alle Algorithmen in lauffähige Programme eingebettet, so daß beides möglich ist: das theoretische Nachvollziehen und das praktische Ausprobieren.