I am trying to understand algorithms and especially the Big-O notation and I came across this question that included logs:
The question wants me to prove that the Big-O notations for $\log_3 x$ is $\log_2 x$. I know how to solve the ones with no logs, but I am very confused on how to approach the ones with logs. Thank you so much in advance!
Do I start by breaking it down?
$\log_3 x$ is $O(\log_2 x)$, where $3$ and $2$ are the log bases.