3 votes
Accepted

What does $o_n(1)$ mean?

As I understand it, this $o_n(1)$ is meant as the standard “little o” notation (when $v_n$ takes non-zero values, $u_n = o(v_n)$ means $\frac{u_n}{v_n} → 0$), except that because several variables are ...
Jean Abou Samra'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
2 votes

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

Recall that the time complexity of an algorithm is expressed in terms of its input size. The growth rate of this complexity measure is usually expressed in terms of an asymptotic notation such as Big-...
codeR's user avatar
  • 565
1 vote

Proving a function of asymptotic Notation

Suppose $f(n) = n^2$. Clearly, we have $f(n) \in \Omega(n)$ but $f(n) \notin O(n)$. It does not require the information given for $g(n)$. Had the quotation been to prove/disprove $f(n) \in O(g(n))$, ...
codeR's user avatar
  • 565

Only top scored, non community-wiki answers of a minimum length are eligible