int test(int n) { if (n <= 1) return 1; return (2 * test(n - 1) + 3 * test(n - 2)); }
O(logn)
O(nlogn)
O(n^2)
O(n^3)
O(2^n)