## Discussion Forum

Que. | The time complexity of the following C function is (assume n > 0)
int recursive (int n) { if (n == 1) return (1); else return (recursive (n - 1) + recursive (n - 1)); } |

a. | O(n) |

b. | O(n log n) |

c. | O(n^2) |

d. | O(2^n) |

Answer:O(2^n) |