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

推荐订阅源

M
MIT News - Artificial intelligence
H
Help Net Security
GbyAI
GbyAI
酷 壳 – CoolShell
酷 壳 – CoolShell
The GitHub Blog
The GitHub Blog
博客园 - 三生石上(FineUI控件)
T
Troy Hunt's Blog
cs.CL updates on arXiv.org
cs.CL updates on arXiv.org
Project Zero
Project Zero
PCI Perspectives
PCI Perspectives
B
Blog RSS Feed
G
GRAHAM CLULEY
Recent Announcements
Recent Announcements
Google DeepMind News
Google DeepMind News
雷峰网
雷峰网
Recorded Future
Recorded Future
Know Your Adversary
Know Your Adversary
Attack and Defense Labs
Attack and Defense Labs
C
Cisco Blogs
月光博客
月光博客
Spread Privacy
Spread Privacy
J
Java Code Geeks
The Register - Security
The Register - Security
V2EX - 技术
V2EX - 技术
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
美团技术团队
Latest news
Latest news
爱范儿
爱范儿
Hacker News - Newest:
Hacker News - Newest: "LLM"
Martin Fowler
Martin Fowler
Threat Intelligence Blog | Flashpoint
Threat Intelligence Blog | Flashpoint
C
Cyber Attacks, Cyber Crime and Cyber Security
Microsoft Security Blog
Microsoft Security Blog
Y
Y Combinator Blog
P
Privacy & Cybersecurity Law Blog
Security Archives - TechRepublic
Security Archives - TechRepublic
博客园 - 叶小钗
B
Blog
Application and Cybersecurity Blog
Application and Cybersecurity Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Security Latest
Security Latest
博客园 - 司徒正美
C
CERT Recently Published Vulnerability Notes
V
Visual Studio Blog
The Cloudflare Blog
IT之家
IT之家
The Hacker News
The Hacker News
The Last Watchdog
The Last Watchdog
Apple Machine Learning Research
Apple Machine Learning Research
人人都是产品经理
人人都是产品经理

博客园 - 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