Actually it is 10/9. Please refer to CLRS text book at page 176. If a node size is divided by n then the log base should be n for getting height of tree. If it is divided by 2 (binary), then the height should be log2(n). Here the part is dividied by 10/9, which is reciprocal of 9/10.
in worst case why did we did (n-k-1) =1 instead of (n-k)=1???
Interesting video amazing
How do you write 10/ 3 at base of log in average case madam?
Actually it is 10/9. Please refer to CLRS text book at page 176. If a node size is divided by n then the log base should be n for getting height of tree. If it is divided by 2 (binary), then the height should be log2(n). Here the part is dividied by 10/9, which is reciprocal of 9/10.
mam ur linkedin id
Mam where is average case time complexity
The tree method is for average case Analysis
@@anjalisharmaCS-IT OK mam
Thanks
Love from heart
New subscriber