惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

GbyAI
GbyAI
Martin Fowler
Martin Fowler
Y
Y Combinator Blog
F
Full Disclosure
Help Net Security
Help Net Security
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
The Hacker News
The Hacker News
大猫的无限游戏
大猫的无限游戏
T
Threat Research - Cisco Blogs
L
LINUX DO - 热门话题
Know Your Adversary
Know Your Adversary
U
Unit 42
P
Palo Alto Networks Blog
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
Apple Machine Learning Research
Apple Machine Learning Research
Spread Privacy
Spread Privacy
T
Tor Project blog
Simon Willison's Weblog
Simon Willison's Weblog
C
Cyber Attacks, Cyber Crime and Cyber Security
Cyberwarzone
Cyberwarzone
MongoDB | Blog
MongoDB | Blog
爱范儿
爱范儿
阮一峰的网络日志
阮一峰的网络日志
雷峰网
雷峰网
N
News and Events Feed by Topic
Microsoft Security Blog
Microsoft Security Blog
人人都是产品经理
人人都是产品经理
C
Check Point Blog
P
Proofpoint News Feed
D
DataBreaches.Net
Security Archives - TechRepublic
Security Archives - TechRepublic
aimingoo的专栏
aimingoo的专栏
Threat Intelligence Blog | Flashpoint
Threat Intelligence Blog | Flashpoint
F
Fortinet All Blogs
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
S
SegmentFault 最新的问题
L
LINUX DO - 最新话题
Security Latest
Security Latest
T
Threatpost
博客园 - 【当耐特】
Cloudbric
Cloudbric
P
Privacy International News Feed
博客园 - 聂微东
M
MIT News - Artificial intelligence
S
Security @ Cisco Blogs
cs.CV updates on arXiv.org
cs.CV updates on arXiv.org
Attack and Defense Labs
Attack and Defense Labs
www.infosecurity-magazine.com
www.infosecurity-magazine.com
S
Secure Thoughts

博客园 - Zero Lee

调用栈(call stack) 关于STL allocator Calculate maximum sum of any subarray set Convert one binary search tree to double-linked list 设计包含min函数的栈 类模板的模板友元函数定义 一道百度的面试题解答 非printf形式的十六进制和二进制打印(雅虎面试题) 一道腾讯面试题 (转)C++中extern “C”含义深层探索 selection algorithm to select nth small elements based on partition 删除与某个字符相邻且相同的字符 产生全排列的方法解析 一组数的全排列和组合程序实现 求一个正整数的平方根程序实现 [转]多线程队列的算法优化 [转载] STL allocator的介绍和一个基于malloc/free的allocator的简单实现 如何将一片内存链接成链表 One simple counted object pointer
Calcuate power n of x recursively
Zero Lee · 2012-06-17 · via 博客园 - Zero Lee

Given x and n, calculate its power n:

 1 int power(int x, int n)
 2 {
 3    if (n==0) 
 4      return 1;
 5    else (n%2==0) 
 6      return power(x*x, n/2);
 7    else 
 8      return x*power(x*x, n/2);
 9 }
10   
11