The time complexities I have are, best case: o(1), worst case: o(n). Is this correct?
template typename T::value_type recursive_vector_sum(
