retagged by
310 views

1 Answer

3 votes
3 votes
Divide $x^{n}$ into 2 parts viz. $x^{{n}/{2}}$ and $x^{{n}/{2}}$. Now, calculating the one of the 2 branches is suffcient. So, we just calculate the value of single $x^{{n}/{2}}$. Now, proceed down the tree in the same fashion.

So, time complexity is O(logn)

Related questions

1 votes
1 votes
1 answer
2
meethunjadhav asked Jul 30, 2018
438 views
suppose merge sort takes 2 sec to sort a set of 64 keys then how much time will take to sort a set of 512 keys?here, ans is 24 sec how it is plz explain me.
2 votes
2 votes
1 answer
3