2019-03-19 Daily Challenge

Posted on:
Posted modified:
In: DailyChallenge

Change again.

I change challenges into challenging my self learning, so there will be my daily notes for what I've learn.

TBH I don't know if it's a good enough form as which to record it.

Let's try it~

  • Complexity of an algorithm $A​$ is a function $C_A(n)​$,defined to be the maximum, over all input $I​$ of size at most $n​$, of the cost of running $A​$ on input $I​$ .
  • Complexity estimates depends dramatically on the underlying assumptions.
NumberTheory