What is a sorting function?

DOI10.1016/J.JLAP.2008.12.003zbMATH Open1187.68181OpenAlexW2116091187MaRDI QIDQ843213FDOQ843213

Authors: Fritz Henglein 

Publication date: 29 September 2009

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2008.12.003

Recommendations

• Stable in situ sorting and minimum data movement
• Functional algorithm design
• STACS 2005
• Sorting stably, in place, with \(O(n \log n)\) comparisons and \(O(n)\) moves
• Generic top-down discrimination for sorting and partitioning in linear time

zbMATH Keywords

permutationcomparatorstableparametricsortingisomorphismparametricitysorting algorithminequality testsort functionsorting function

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Title not available (Why is that?)
• Introduction to algorithms
• Title not available (Why is that?)
• Relations Among Complexity Measures
• Title not available (Why is that?)
• Contracts for higher-order functions
• Generic discrimination: sorting and partitioning unshared data in linear time
• Radix Sorting with No Extra Space
• Much ado about two (pearl), a pearl on parallel prefix computation
• What is a sorting function?

Cited In (4)

• Generic discrimination: sorting and partitioning unshared data in linear time
• What is a sorting function?
• All sorts of permutations (functional pearl)
• Generic top-down discrimination for sorting and partitioning in linear time

Uses Software

• Eiffel

This page was built for publication: What is a sorting function?

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