Matches in DBpedia 2014 for { <http://dbpedia.org/resource/In-place_algorithm> ?p ?o. }
Showing items 1 to 33 of
33
with 100 items per page.
- In-place_algorithm abstract "In computer science, an in-place algorithm (or in Latin in situ) is an algorithm which transforms input using a data structure with a small, constant amount of extra storage space. The input is usually overwritten by the output as the algorithm executes. An algorithm which is not in-place is sometimes called not-in-place or out-of-place (or ex situ in Latin).An algorithm is sometimes, informally, called in-place as long as it overwrites its input with its output. In reality, this is not sufficient (as the case of quicksort demonstrates), nor is it necessary; the output space may be constant, or may not even be counted, for example if the output is to a stream. On the other hand, sometimes it may be more practical to count the output space in determining whether an algorithm is in-place, such as in the first reverse example below; this makes it difficult to strictly define in-place algorithms. In theory applications such as log-space reductions, it's more typical to always ignore output space (in these cases it's more essential that the output is write-only).".
- In-place_algorithm wikiPageID "219861".
- In-place_algorithm wikiPageRevisionID "587500036".
- In-place_algorithm hasPhotoCollection In-place_algorithm.
- In-place_algorithm subject Category:Algorithms.
- In-place_algorithm type Abstraction100002137.
- In-place_algorithm type Act100030358.
- In-place_algorithm type Activity100407535.
- In-place_algorithm type Algorithm105847438.
- In-place_algorithm type Algorithms.
- In-place_algorithm type Event100029378.
- In-place_algorithm type Procedure101023820.
- In-place_algorithm type PsychologicalFeature100023100.
- In-place_algorithm type Rule105846932.
- In-place_algorithm type YagoPermanentlyLocatedEntity.
- In-place_algorithm comment "In computer science, an in-place algorithm (or in Latin in situ) is an algorithm which transforms input using a data structure with a small, constant amount of extra storage space. The input is usually overwritten by the output as the algorithm executes. An algorithm which is not in-place is sometimes called not-in-place or out-of-place (or ex situ in Latin).An algorithm is sometimes, informally, called in-place as long as it overwrites its input with its output.".
- In-place_algorithm label "Algoritmo in loco".
- In-place_algorithm label "Algorytm in situ".
- In-place_algorithm label "In-place algorithm".
- In-place_algorithm label "In-place".
- In-place_algorithm label "In-placeアルゴリズム".
- In-place_algorithm label "原地算法".
- In-place_algorithm sameAs In-place_algoritmus.
- In-place_algorithm sameAs In-place.
- In-place_algorithm sameAs Algoritmo_in_loco.
- In-place_algorithm sameAs In-placeアルゴリズム.
- In-place_algorithm sameAs Algorytm_in_situ.
- In-place_algorithm sameAs m.01g41m.
- In-place_algorithm sameAs Q657037.
- In-place_algorithm sameAs Q657037.
- In-place_algorithm sameAs In-place_algorithm.
- In-place_algorithm wasDerivedFrom In-place_algorithm?oldid=587500036.
- In-place_algorithm isPrimaryTopicOf In-place_algorithm.