Register

Algorithm cormen problem 1.1

514 views
1 votes
1 votes

Comparison of running times.A couple of running time functions like

f(n)=nlg n
f(n)=n!

and the following durations: 1second, 1minute, 1hour, 1 day, 1month, 1year, 1century

The f(n) functions describe the time taken in microseconds and determine the largest n which still runs in the given time.

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
Aarvi Chawla asked Jun 11, 2018
255 views
Cormen 3rd edition Problem 3-2 part (f)
Indicate for pair of expressions (A,B) whether A is O, o, Ω, ω or of B? A = lg(n!) B = lg(n^n)
Indicate for pair of expressions (A,B) whether A is O, o, Ω, ω or of B?A = lg(n!)B = lg(n^n)
User Avatar
0 votes
0 votes
1 answer
2
amitatgateoverflow asked Jul 18, 2016
406 views
book[cormen - solution 2nd edition] solution to problem 3-3
Prove that : log*(log n) = log*n -1.
Prove that : log*(log n) = log*n -1.
User Avatar
0 votes
0 votes
0 answers
4
Swapnil Naik asked Jul 23, 2018
663 views
Introduction to Algorithm - Cormen
I didn't understand Big-O notation: This is CORMEN exercise problem - 3.1-2 Solution link: https://www.csee.umbc.edu/~nam1/TA/HWSols/hw1sol.pdf
I didn't understand Big-O notation: This is CORMEN exercise problem - 3.1-2Solution link: https://www.csee.umbc.edu/~nam1/TA/HWSols/hw1sol.pdf
User Avatar
Link Copied!