Space complexity

Amount of memory space that an algorithm uses as a function of the input's size

Texto en inglés

Último precio

—

Precio mínimo

—

Mediana 7 d

—

Ventas 30 d

Rango 30 d

—

En circulación

Cotización

Ver tabla

Fecha	mediana	Mín	Máx	ventas

Historial de ventas

Última venta: —
Media 30 d: —
Mínimo 30 d: —
Máximo 30 d: —
Ventas 7 d: 0
Ventas 30 d: 0

Aún no hay ventas.

Ventas anónimas: sin comprador ni vendedor. Las cifras solo cuentan ventas entre jugadores.

En Wikipedia

Texto en inglés Aún no hay artículo en tu idioma: extracto en inglés.

The space complexity of an algorithm or a data structure is the amount of memory space required to solve an instance of the computational problem as a function of characteristics of the input. It is the memory required by an algorithm until it executes completely. This includes the memory space used by its inputs, called input space, and any other (auxiliary) memory it uses during execution, which is called auxiliary space. Similar to time complexity, space complexity is often expressed asymptotically in big O notation, such as 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 a characteristic of the input influencing space complexity.

Texto: Wikipedia en inglés, CC BY-SA 4.0. ·

Cartas cercanas

Cargar más