Metraipolis › archive › dc_9c8d5fbbf80a

Online algorithm — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Online_algorithm
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T13:49:05.532Z
SHA-256 of the archived text
a16473783dd2cc9aeba58ff98af2d2e412aa0e73f5a87e63efe6f0ca2f41d086
Stable URL of this page
https://metraipolis.com/documento/dc_9c8d5fbbf80a

How to cite

Online algorithm — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Online_algorithm (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_9c8d5fbbf80a (Metraipolis archive dc_9c8d5fbbf80a, sha256 a16473783dd2cc9aeba58ff98af2d2e412aa0e73f5a87e63efe6f0ca2f41d086)
BibTeX
@misc{dc9c8d5fbbf80a,
  title = {Online algorithm — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Online_algorithm},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_9c8d5fbbf80a; sha256 a16473783dd2cc9aeba58ff98af2d2e412aa0e73f5a87e63efe6f0ca2f41d086},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Online_algorithm. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In computer science, an online algorithm is one that can process its input piece-by-piece in a serial fashion, i.e., in the order that the input is fed to the algorithm, without having the entire input available from the start. In contrast, an offline algorithm is given the whole problem data set from the beginning and is required to output an answer which solves the problem at hand. In operations research, the area in which online algorithms are developed is called online optimization. As an example, consider the sorting algorithms selection sort and insertion sort: selection sort repeatedly selects the minimum element from the unsorted remainder and places it at the front, which requires access to the entire input; it is thus an offline algorithm. On the other hand, insertion sort considers one input element per iteration and produces a partial solution without considering future elements. Thus insertion sort is an online algorithm. Note that the final result of an insertion sort is optimum, i.e., a correctly sorted list. For many problems, online algorithms cannot match the performance of offline algorithms. If the ratio between the performance of an online algorithm and an optimal offline algorithm is bounded, the online algorithm is called competitive. Not every offline algorithm has an efficient online counterpart.

Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; ricerca «algorithm»).
Fonte: Wikipedia in inglese, voce «Online algorithm» — https://en.wikipedia.org/wiki/Online_algorithm
Wikidata Q786431 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q786431
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Online_algorithm?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1375518178, consultata il 2026-10-07T13:20:46.342Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: a688519603198b290d1bb079d39da54456d0cf3b0bea82007ba4b1e79f5143dc