Community

Start a Thread
Filters
By Category
Notifications
Subscribe You’re not receiving notifications from this thread.

Understanding Big O And Algorithmic Complexity (Main Thread)

General • Asked almost 4 years ago by Anonymous

Jake from AlgoDaily Commented on May 14, 2020:

This is the main discussion thread generated for Understanding Big O And Algorithmic Complexity.

Anonymous Commented on May 14, 2020:

[deleted]

Anonymous Commented on May 14, 2020:

[deleted]

Bhupender Singh Commented on May 14, 2020:

Hi,

Just wanted to confirm,
The table in the article says,
Logarithm -> O(nlog(n))
Shouldn't it be O(log(n), and if it is O(nlog(n)) then it would be called Linearithmic ?

Anonymous Commented on May 21, 2020:

yes same question. i guess that was a mistake

Jake from AlgoDaily Commented on Aug 11, 2020:

Resolved!

Jake from AlgoDaily Commented on Aug 16, 2020:

Fixed the order and added O(n!), thanks!