2022年4月19日
Compute the classic Fibonacci running times quantitatively via the third variable
摘要： //Util.h static unsigned long long factorialLoops; long double Fibonacci35(int len); //Util.cpp unsigned long long Util::factorialLoops=0; long double 阅读全文
posted @ 2022-04-19 23:46 FredGrit 阅读(13) 评论(0) 推荐(0) 编辑
C++ numeric types max values via numeric_limits<T>::max()
摘要： #include <iostream> #include <limits.h> void Util::showMax(){ cout<<fixed<<"INT32_MAX="<<INT32_MAX<<endl; cout<<fixed<<"UINT32_MAX="<<UINT32_MAX<<endl 阅读全文
posted @ 2022-04-19 22:39 FredGrit 阅读(50) 评论(0) 推荐(0) 编辑
Original Fibonacci and optimized Fibonacci functions and use the third variable to log the recursion times quantitatively
摘要： The common or classic Fibonacci algorithm //Util.h static unsigned long long factorialLoops; long double Fibonacci35(int len); //Util.cpp unsigned lon 阅读全文
posted @ 2022-04-19 22:01 FredGrit 阅读(22) 评论(0) 推荐(0) 编辑