|
|||||||||||
Technical Support On-Line Manuals Cx51 User's Guide Cx51 Introduction Compiling Programs Language Extensions Preprocessor Advanced Programming 8051 Derivatives Error Messages Library Reference Appendix A. ANSI C Implementation Implementation-defined Behavior Compiler-Related Library-Related B. Version Differences Version 6.0 Differences Version 5.0 Differences Version 4.0 Differences Version 3.4 Differences Version 3.2 Differences Version 3.0 Differences Version 2.0 Differences C. Writing Optimum Code Memory Model Variable Location Variable Size Unsigned Types Local Variables Other Sources D. Compiler Limits E. Byte Ordering F. Hints, Tips, and Techniques Recursive Code References Problems Using printf Uncalled Functions Using Monitor-51 Trouble with bdata Function Pointers |
Other SourcesThe 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 | ||||||||||
|
Arm’s Privacy Policy has been updated. By continuing to use our site, you consent to Arm’s Privacy Policy. Please review our Privacy Policy to learn more about our collection, use and transfers
of your data.