I\'m having some trouble determining the time complexity of this recursive function in terms of Big-O notation.
double ex
