About: Proxmap sort

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Proxmap sort Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

ProxmapSort, or Proxmap sort, is a sorting algorithm that works by partitioning an array of data items, or keys, into a number of "subarrays" (termed buckets, in similar sorts). The name is short for computing a "proximity map," which indicates for each key K the beginning of a subarray where K will reside in the final sorted order. Keys are placed into each subarray using insertion sort. If keys are "well distributed" among the subarrays, sorting occurs in linear time. The computational complexity estimates involve the number of subarrays and the proximity mapping function, the "map key," used. It is a form of bucket and radix sort.

Attributes	Values
rdfs:label	Proxmap sort (en)
rdfs:comment	ProxmapSort, or Proxmap sort, is a sorting algorithm that works by partitioning an array of data items, or keys, into a number of "subarrays" (termed buckets, in similar sorts). The name is short for computing a "proximity map," which indicates for each key K the beginning of a subarray where K will reside in the final sorted order. Keys are placed into each subarray using insertion sort. If keys are "well distributed" among the subarrays, sorting occurs in linear time. The computational complexity estimates involve the number of subarrays and the proximity mapping function, the "map key," used. It is a form of bucket and radix sort. (en)
sameAs	Proxmap sort Proxmap sort
dbp:wikiPageUsesTemplate	dbt:Citation_needed dbt:Cite_journal dbt:Clear dbt:ISBN dbt:Math dbt:OR dbt:Sorting dbt:Infobox_Algorithm
Subject	Articles with example pseudocode Sorting algorithms Stable sorts
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Proxmap_sort?oldid=956250745&ns=0
Wikipage page ID	29554327 (xsd:integer)
page length (characters) of wiki page	14283 (xsd:nonNegativeInteger)
Wikipage revision ID	956250745 (xsd:integer)
has abstract	ProxmapSort, or Proxmap sort, is a sorting algorithm that works by partitioning an array of data items, or keys, into a number of "subarrays" (termed buckets, in similar sorts). The name is short for computing a "proximity map," which indicates for each key K the beginning of a subarray where K will reside in the final sorted order. Keys are placed into each subarray using insertion sort. If keys are "well distributed" among the subarrays, sorting occurs in linear time. The computational complexity estimates involve the number of subarrays and the proximity mapping function, the "map key," used. It is a form of bucket and radix sort. Once a ProxmapSort is complete, ProxmapSearch can be used to find keys in the sorted array in time if the keys were well distributed during the sort. Both algorithms were invented in the late 1980s by Prof. Thomas A. Standish at the University of California, Irvine. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Proxmap_sort
is Link from a Wikipage to another Wikipage of	Interpolation sort

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software