00:01
Here, tn is equals to 2t n divide by 2 plus log n.
00:09
This is in the form of tn is equals to a multiply by t multiply by n divide b plus f multiply by n.
00:19
We can use here master theorem a is 2, b is 2 so n log a is equals to n log 2 power 2 is equals to n power 1 that is n.
00:38
Now, n log a is equals to here n log 2 power 2 which is equals to n power 1 is equals to n which is smaller which is greater than fn is equals to log n.
00:59
So, it is come under case 1.
01:04
So, time complexity is here 5 n.
01:10
Now, here tn is equals to 16t n divide by 2 plus n log n whole power 4.
01:23
This is in the form of tn is equals to a multiply by t multiply by n divide by b plus fn.
01:33
We can use here master where a is equals to 16, b is equals to 2 and n log b is equals to n log 2 16 is equals to n 4...