New answers tagged

0 votes

Solving recurance relation with master theorem

Apparently, you can't prove it because it is incorrect. Let's assume that $a=1$ and $b>1$. So, we get: $T(n) = aT(n/b) + cn^a = T(n/b) + cn = \Theta(n)$ But you are trying to show that if $a=a^b$, ...
user4569455's user avatar
2 votes
Accepted

Time Complexity O-Notation for Kociemba, Korf, and Thistlethwaite's Algorithms? (Rubik cube)

As noted in the answer of codeR Big O notation makes no sense for 3x3x3 alone because of the constant input size. What might be interesting to discuss is the time complexity to find a solution with ...
Herbert Kociemba's user avatar

Top 50 recent answers are included