Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Sorting in linear expected time

From MaRDI portal
Publication:1064785
Jump to:navigation, search

DOI10.1007/BF01935365zbMath0576.68050MaRDI QIDQ1064785

D. C. S. Allison, M. T. Noga

Publication date: 1985

Published in: BIT (Search for Journal in Brave)


zbMATH Keywords

quicksortdistributive partitioninghybrid sortingstatistical sorting


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)


Related Items (2)

The multilevel principle applied to sorting ⋮ A space efficient distributive sort


Uses Software

  • Quicksort


Cites Work

  • Some performance tests of convex hull algorithms
  • Average time behavior of distributive sorting algorithms
  • The design and analysis of a new hybrid sorting algorithm
  • Usort: An efficient hybrid of distributive partitioning sorting
  • Sorting by distributive partitioning
  • Implementing Quicksort programs
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Sorting in linear expected time

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1064785&oldid=13082023"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 23:55.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki