- 博客(1)
- 资源 (1)
- 收藏
- 关注
原创 算法 - 素数
问题判断整数n是不是素数定义素数只能被1以及自身整除的整数 , 例如2 ,3 ,5, 7 , 13 #算法 如何加快素数的判断 , 只需要从2判断到n的平方根 ,即2-sqrt(n) , 我们假设n = x * y , sq = sqrt(n) , 如果x < sq , 那么y > sq , 所以如果 2-sq 都不能被整除 , 那么自然知道不对对应的y , 所以不需要继续判断 > sq的数
2016-08-09 10:22:47 461
Low-Level Programming.pdf
This book aims to help you develop a consistent vision of the domain of low-level programming. We want to
enable a careful reader to
• Freely write in assembly language.
• Understand the Intel 64 programming model.
• Write maintainable and robust code in C11.
• Understand the compilation process and decipher assembly listings.
• Debug errors in compiled assembly code.
• Use appropriate models of computation to greatly reduce program complexity.
• Write performance-critical code.
There are two kinds of technical books: those used as a reference and those used to learn. This book
is, without doubt, the second kind. It is pretty dense on purpose, and in order to successfully digest the
information we highly suggest continuous reading. To quickly memorize new information you should try to
connect it with the information with which you are already familiar. That is why we tried, whenever possible,
to base our explanation of each topic on the information you received from previous topics.
This book is written for programming students, intermediate-to-advanced programmers, and low-level
programming enthusiasts. The prerequisites are a basic understanding of binary and hexadecimal systems
and a basic knowledge of Unix commands.
2019-08-30
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人