피보나치1

• 피보나치 수열 #include #include #include using namespace std; int Fibonacci(int num) { if (num == 0) return 0; else if (num == 1)return 1; else return (Fibonacci(num - 1) + Fibonacci(num - 2)); } int SIZE = 30; void main() { // IO 속도 향상 ios_base::sync_with_stdio(false); cin.tie(NULL); clock_t start, finish; double duration; start = clock(); Fibonacci(SIZE); finish = clock(); duration = (double)(finish - start.. c++/알고리즘 2022. 3. 16.