Sorting a linked list with equal keys

DOI10.1016/0020-0190(82)90118-1MaRDI QIDQ1171387zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A stable quicksort
• Implementing Quicksort programs
• Quicksort
• Quicksort with Equal Keys
• The analysis of Quicksort programs

Cited in

(2)

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

Describes a project that uses

Uses Software

• Quicksort

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1171387)