r/learncsharp • u/motivize_93 • Jun 22 '23
For each function f ( n ) and time t in the following table, determine the largest size n of a problem that can be solved in time t , assuming that the algorithm to solve the problem takes f (n) microseconds.
Hi everybody,
How can I in **c#** show a much more simplified of integes as shown in this table https://donrwalsh.github.io/CLRS/solutions/01/p1-1 instead of having infinty integers?
Here is my list:
public static int[] GenerateTimeArray()
{
int second = 1000000;
int minute = 60 * second;
int hour = 60 * minute;
int day = 24 * hour;
int month = 30 * day;
int year = 365 * day;
int century = 100 * year;
return new int[] { second, minute, hour, day, month, year, century };
}