| ||||
| Home Products Download Events Support | ||||
Technical Support
On-Line Manuals
C251 User's Guide
C251 Introduction Compiling Programs Language Extensions Preprocessor Advanced Programming Error Messages Library Reference 
Appendix A. ANSI C Implementation 
Implementation-defined Behavior Compiler-Related Library-Related B. Version Differences Version 1.0 Differences C51 Version 5 Differences C. Writing Optimum Code Memory Model Variable Location Variable Size Local Variables Use 251 Source Mode Other Sources D. Compiler Limits E. Byte Ordering F. Hints, Tips, and Techniques Tips for Program Execution Tips for the Stack Tips for Interrupts Function Pointers Problems Using printf Uncalled Functions Trouble with bdata Tips for Porting C51 Code Tips for the Intel RISM MonitorOther Sources
The quality of the compiler-generated code is more often than not directly influenced by the algorithms implemented in the program. Sometimes, you can improve the performance or reduce the code size simply by using a different algorithm. For example, a heap sort algorithm always outperforms a bubble sort algorithm.
For more information on how to write efficient programs, refer to the following books:
The Elements of Programming Style, Second Edition
Kernighan & Plauger
McGraw-Hill
ISBN 0-07-034207-5
Writing Efficient Programs
Jon Louis Bentley
Prentice-Hall Software Series
ISBN 0-13-970244-X
Efficient C
Plum & Brodie
Plum Hall, Inc.
ISBN 0-911537-05-8
Algorithms in C
Robert Sedgewick
Addison Wesley
ISBN 0-201-51425-7
Data Structures, Algorithms & Software Principles in C
Thomas A. Standish
Addison Wesley
ISBN 0-201-59118-9
| Contact Site Map Press Privacy | Copyright © 2012 ARM Ltd and ARM Germany GmbH. All rights reserved. |
