I am reading Introduction to Algorithms 3rd edition and it says that $O(cn \log_{3/2}n) = O(n \lg{n})$. But isn't $\lg{x}$ tighter than $\log_{3/2}x$?
2026-04-01 12:49:36.1775047776
How is $O(cn \log_{3/2}n) = O(n \lg{n})$?
942 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
2
Recall that $\text{log}_{2}(n) = \dfrac{\log_{3}(n)}{\log_{3}(2)}$, per the change of base formula. The $\log_{3}(2)$ term is absorbed by the constant factor, which you have from the definition of Big-O.