In other words, the more tasks (n) are active, the longer it takes to schedule a task.
换而言之，活动的任务越多，调度任务所花费的时间越长。
If Repeats=n, only a single check would occur before deleting the task.
如果Repeats=n，那么在删除该任务之前只会执行一次检查。
O(log n) behavior is measurably slower, but only marginally for very large task counts.
O(logn)行为具有可测量的延迟，但是对于较大的任务数无关紧要。
Reversing the contents of a file is not a common task, but the following one-liners show than the -n and -p switches are not always the best choice when processing an entire file.
使文件内容反向排列并不是常见的任务，但是以下几个一行程序显示了- n开关和- p开关并不总是处理整个文件的最佳选择。
The goal behind measuring n executions of task (n >= 1) is to make the cumulative execution time so large that all the time measurement errors I discuss above become insignificant.
度量task的n 次执行的目的在于，让累计的执行时间足够大，从而减少前面讨论的所有时间度量误差的影响。
Use Step 3 to calculate n, the number of task executions whose cumulative execution time is sufficiently large.
使用步骤3计算n，这是执行task的次数，这些次执行的累计时间必须足够大。
Your task is for a given n, find out how many kinds of legal placed method.
你的任务是，对于给定的N，求出有多少种合法的放置方法。
Your task is for a given n, find out how many kinds of legal placed method.
你的任务是，对于给定的N，求出有多少种合法的放置方法。
应用推荐