Examples of using Running time in English and their translations into Ukrainian
{-}
-
Colloquial
-
Ecclesiastic
-
Computer
We can also measure different values, not just the running time.
provide the longest running time to refusal.
Indeed, in the daily life of SamsungGalaxy S10+ shows excellent running time, but not the best.
must include the film title, running time and country only.
A feature film has a running time of more than 60 minutes and a short film has a running time of 40 minutes or less.
The running time is of order O(2NN),
streaming will shorten the running time.
The running time of an algorithm on a particular input is the number of primitive operations or"steps" executed.
This modified(randomized) algorithm will have small expected running time, whatever the input order.
More precisely, this means that there is a constant c such that the running time is at most cn for every input of size n.
Algorithms with running time O(n log n) are sometimes called linearithmic.
with the same asymptotic running time as the repeated Dijkstra approach.
Its 163-minute running time, limiting the number of screenings,
Monstrous, as for cinemas, running time of 175 minutes without an intermission was scaring film providers away.
Also, in addition to the stage in Le Mans, during the season, another 8 races are held with a running time of at least 6 hours.
The three loops in iterative matrix multiplication can be arbitrarily swapped with each other without an effect on correctness or asymptotic running time.
Despite the name"constant time", the running time does not have to be independent of the problem size,
This film set the standard for most of the Dracula sequels in the sense that half the film's running time was spent on telling the story of Dracula's resurrection
Since an algorithm's running time may vary among different inputs of the same size, one commonly considers the worst-case time complexity, which is the
for a given input size n greater than some n0 and a constant c, the running time of that algorithm will never be larger than c× f(n).
