- 博客(3)
- 资源 (19)
- 收藏
- 关注
原创 简单的[0/1]背包问题 分别用递归与非递归实现
<br />#include <iostream> using namespace std; bool Kanpsack(int kanpsack_weight, int object_weight[], int object_num) { cout << kanpsack_weight << " " << *object_weight << " " << object_num << endl; if (kanpsack_weight == *object_weight) { ret
2010-08-31 21:53:00 531
原创 求最大值,递归与非递归方法
#include #include #include int recursive(unsigned int num, int data[]) { int nextdata, curdata = *data; if (num == 1) { return curdata; } nextdata = recursive(--num, ++data); return curdata > nextdata ? curdata : nextdata; }
2010-08-28 11:47:00 675
原创 Compiling and Linking MKL with Microsoft* Visual C/C++*
<br />连接网址:http://software.intel.com/en-us/articles/intel-math-kernel-library-intel-mkl-compiling-and-linking-with-microsoft-visual-cc/
2010-08-27 21:23:00 476
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人