How is the complexity of recursive algorithms calculated and do they admit better complexity than non-recursive algorithms?
Typically, by writing a recurrence relation for the running time and then solving the recurrence relation.  See How to come up with the runtime of algorithms? and Solving or approximating recurrence relations for sequences of numbers.   You might also want to read your friendly textbook and Is there a system behind the magic of algorithm analysis?.