running time - traduzione in olandese
Diclib.com
Dizionario ChatGPT
Inserisci una parola o una frase in qualsiasi lingua 👆
Lingua:

Traduzione e analisi delle parole tramite l'intelligenza artificiale ChatGPT

In questa pagina puoi ottenere un'analisi dettagliata di una parola o frase, prodotta utilizzando la migliore tecnologia di intelligenza artificiale fino ad oggi:

  • come viene usata la parola
  • frequenza di utilizzo
  • è usato più spesso nel discorso orale o scritto
  • opzioni di traduzione delle parole
  • esempi di utilizzo (varie frasi con traduzione)
  • etimologia

running time - traduzione in olandese

ESTIMATE OF TIME TAKEN FOR RUNNING AN ALGORITHM
Polynomial time; Exponential time; Linearithmic function; Subquadratic time; Running time; Linear time; Cubic time; Quadratic time; Algorithmic time complexity; Polynomial-time; Polynomial-time algorithm; Polynomial-time solutions; Polynomial-time solution; Computation time; Constant time; Exponential algorithm; Logarithmic time; Linear-time; Linearithmic; N log n; Weakly polynomial; Strongly polynomial; Run-time complexity; Sublinear time; Sublinear-time; Sublinear time algorithm; Linearithm; Computational time; Sub-exponential time; Super-polynomial time; Superpolynomial; Fast algorithms; Quasi-polynomial time; SUBEXP; Linearithmic time; Double exponential time; Polylogarithmic time; Sub-linear time; Polynomial time algorithm; Subexponential time; Nlogn; Quasilinear time; Strongly polynomial time; Polynomial complexity; Linear-time algorithm; Linear time agorithm; Sublinear algorithm; Polytime; Weakly polynomial time algorithm; Time complexities

running time         
WIKIMEDIA DISAMBIGUATION PAGE
Running Time (disambiguation)
werktijd (bv. van electrische apparaat)
execution time         
PROGRAM LIFECYCLE PHASE, TIME DURING WHICH A PROGRAM IS RUNNING (EXECUTING)
Execution time; Runtime performance; Runtime error; Run-time error; Runtime errors; Run time error; At runtime; Run-time behaviour; Integer divide by zero; Runtime (computing); Run time (program lifecycle phase); Running (computing)
uitvoeringstijd (de tijd die de uitvoering in beslag neemt)
universal time         
  • An 1853 "Universal Dial Plate" showing the relative times of "all nations" before the adoption of universal time
TIME STANDARD BASED ON THE SLOWING ROTATION OF THE EARTH
Universal Standard Time; UT0; UT2; Ut1; UT1; UT1R; UT2R; UTC-SLS; Universal Time (UT); Universal time
n. Greenwichtijd

Definizione

running time
(running times)
The running time of something such as a film, video, or CD is the time it takes to play from start to finish.
N-COUNT

Wikipedia

Time complexity

In computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that each elementary operation takes a fixed amount of time to perform. Thus, the amount of time taken and the number of elementary operations performed by the algorithm are taken to be related by a constant factor.

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 maximum amount of time required for inputs of a given size. Less common, and usually specified explicitly, is the average-case complexity, which is the average of the time taken on inputs of a given size (this makes sense because there are only a finite number of possible inputs of a given size). In both cases, the time complexity is generally expressed as a function of the size of the input.: 226  Since this function is generally difficult to compute exactly, and the running time for small inputs is usually not consequential, one commonly focuses on the behavior of the complexity when the input size increases—that is, the asymptotic behavior of the complexity. Therefore, the time complexity is commonly expressed using big O notation, typically O ( n ) {\displaystyle O(n)} , O ( n log n ) {\displaystyle O(n\log n)} , O ( n α ) {\displaystyle O(n^{\alpha })} , O ( 2 n ) {\displaystyle O(2^{n})} , etc., where n is the size in units of bits needed to represent the input.

Algorithmic complexities are classified according to the type of function appearing in the big O notation. For example, an algorithm with time complexity O ( n ) {\displaystyle O(n)} is a linear time algorithm and an algorithm with time complexity O ( n α ) {\displaystyle O(n^{\alpha })} for some constant α > 1 {\displaystyle \alpha >1} is a polynomial time algorithm.

Esempi dal corpus di testo per running time
1. Audiences were put off by the three–hour running time.
2. But the pleasant film uses up its ideas long before it uses up its running time.
3. Two hours of running time included 35 minutes of sex, including a non–faked act of oral sex.
4. But Udita, who gobbles up more than half the running time, appears capable of doing nothing other than showing acres of fleshy, unexciting flesh.
5. One minute he was a single man running Time Out, living the bachelor life, the next I was there with all my luggage.