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 a linked list with equal keys

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

DOI10.1016/0020-0190(82)90118-1zbMath0498.68037OpenAlexW2010106363MaRDI QIDQ1171387

Lutz Michael Wegner

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90118-1


zbMATH Keywords

analysis of algorithmsquicksortPASCAL version of a sorting algorithm


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Specification and verification (program logics, model checking, etc.) (68Q60)


Related Items (2)

Distribution-sensitive algorithms ⋮ A generalized, one-way, stackless quicksort


Uses Software

  • Quicksort


Cites Work

  • Unnamed Item
  • The analysis of Quicksort programs
  • A stable quicksort
  • Quicksort with Equal Keys
  • Implementing Quicksort programs
  • Quicksort


This page was built for publication: Sorting a linked list with equal keys

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