Big O notation examples
recursive functions1234567int recursiveFun1(int n){if (n <= 0)return 1;elsereturn 1 + recursiveFun1(n-1);}
The first function is being called recursively n times before reaching base case so its O(n), often called linear.
1234567int recu
...