This HTML5 document contains 27 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n14https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Block_sort
dbo:wikiPageWikiLink
dbr:Block_swap_algorithms
Subject Item
dbr:Block_swap_algorithms
rdfs:label
Block swap algorithms
rdfs:comment
In computer algorithms, Block swap algorithms swap two regions of elements of an array. It is simple to swap two non-overlapping regions of an array of equal size. However, it is not simple to swap two non-overlapping regions of an array in-place that are next to each other, but are of unequal sizes (such swapping is equivalent to Array Rotation). Three algorithms are known to accomplish this: Bentley's Juggling (also known as Dolphin Algorithm ), Gries-Mills, and Reversal. All three algorithms are linear time O(n), (see Time complexity).
dcterms:subject
dbc:Arrays dbc:Algorithms dbc:Sorting_algorithms
dbo:wikiPageID
61176336
dbo:wikiPageRevisionID
1099109982
dbo:wikiPageWikiLink
dbr:Big_O_notation dbc:Sorting_algorithms dbc:Algorithms dbr:Cache_(computing) dbr:Array_data_structure dbc:Arrays dbr:Time_complexity dbr:Memory_access_pattern dbr:Algorithm dbr:Parallel_computing
owl:sameAs
wikidata:Q65052660 n14:9oHGS
dbp:wikiPageUsesTemplate
dbt:Context dbt:Reflist
dbo:abstract
In computer algorithms, Block swap algorithms swap two regions of elements of an array. It is simple to swap two non-overlapping regions of an array of equal size. However, it is not simple to swap two non-overlapping regions of an array in-place that are next to each other, but are of unequal sizes (such swapping is equivalent to Array Rotation). Three algorithms are known to accomplish this: Bentley's Juggling (also known as Dolphin Algorithm ), Gries-Mills, and Reversal. All three algorithms are linear time O(n), (see Time complexity).
prov:wasDerivedFrom
wikipedia-en:Block_swap_algorithms?oldid=1099109982&ns=0
dbo:wikiPageLength
1685
foaf:isPrimaryTopicOf
wikipedia-en:Block_swap_algorithms
Subject Item
wikipedia-en:Block_swap_algorithms
foaf:primaryTopic
dbr:Block_swap_algorithms