Recursionhard
0:00.0

A recursive algorithm that calls itself twice for each input (like Merge Sort) often results in which complexity?