What question did this study set out to answer?

Introduce an efficient algorithm to identify the kth smallest element in an unordered array without fully sorting the data.

July 1, 1961Communications of the ACM

Algorithm 65: find

View Full Paper

Ask AI

Bookmark

Introduce an efficient algorithm to identify the kth smallest element in an unordered array without fully sorting the data.
Selects an arbitrary pivot element from the current array segment to partition the sequence into smaller and larger subsets.
Rearranges elements in place such that values less than or equal to the pivot sit on one side and greater values sit on the other.
Restricts subsequent recursive or iterative partition steps solely to the sub-array containing the target rank index.
Positions the kth smallest element into its exact sorted location without spending time fully sorting the remaining array elements.
Achieves expected linear time complexity for selection tasks, significantly outperforming standard sort-and-index approaches.

Implication

Algorithmic proposal demonstrates in-place selection of order statistics in unordered arrays, indicating faster retrieval without full sorting.

Abstract

article Free Access Share on Algorithm 65: find Author: C. A. R. Hoare Elliott Brothers Ltd., Hertfordshire, England, U.K. Elliott Brothers Ltd., Hertfordshire, England, U.K.View Profile Authors Info & Claims Communications of the ACMVolume 4Issue 7July 1961 pp 321–322https://doi.org/10.1145/366622.366647Published:01 July 1961Publication History 129citation1,937DownloadsMetricsTotal Citations129Total Downloads1,937Last 12 Months461Last 6 weeks54 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

Discussion

No takes yet. Share an insight, caveat, or question.

Cite This Study

C. A. R. Hoare (1961) studied this question.

synapsesocial.com/papers/6a1ba11cd426719c76abd533 https://doi.org/10.1145/366622.366647

View Full Paper

Ask AI

Bookmark

Implication

Algorithmic proposal demonstrates in-place selection of order statistics in unordered arrays, indicating faster retrieval without full sorting.

Algorithm 65: find

Key Points

Implication

Abstract

Discussion

Cite This Study

Algorithm 65: find

Key Points

Implication

Abstract

Discussion

Cite This Study

Keep reading

Keep reading