CSFG
Language
English
Deutsch
Beta
Español
Beta
język polski
(2.6.0)
Chapters
Curriculum Guides
Appendices
Search
Algorithm Timer
Algorithm complexity:
log(n)
n
nlog(n)
n²
n³
n
4
n
6
2
n
n!
Results:
Long form
Scientific
Number of items (n):
Please enter a positive integer.
This number is too big for the chosen complexity!
Operations per second:
Please enter a positive number.
This number is too big!
Processors:
Please enter a positive integer.
This number is too big!
n²
operations would take:
Nanoseconds
Microseconds
Milliseconds
Seconds
Minutes
Hours
Days
Years
Centuries
×
This definition is not available in English, sorry!