Complexity analysis and performance of double hashing sort algorithm

DOI10.1186/S42787-019-0004-2MaRDI QIDQ2338136zbMATH OpenOpenAlexFDO

Authors Hazem M. Bahig

Publication date 21 November 2019

Published in Journal of the Egyptian Mathematical Society (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1186/s42787-019-0004-2

zbMATH Keywords

quicksortsortingcomplexity analysisperformance of algorithmcounting sort

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10)

Recommendations

• The analysis of double hashing
• Smoothsort revisited
• Analyzing a class of distributive partitioning sort algorithms
• DUAL PIVOT QUICKSORT

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• An in-place sorting with O ( n log n ) comparisons and O ( n ) moves
• Convex hull of points lying on lines in \(O(n\log n)\) time after preprocessing
• Efficient sorting using registers and caches
• Introduction to algorithms.
• Inversion-sensitive sorting algorithms in practice
• Kinetic sorting and kinetic convex hulls
• On the adaptiveness of Quicksort
• Optimal partitioning for dual-pivot quicksort
• Randomized shellsort: a simple data-oblivious sorting algorithm
• Resource oblivious sorting on multicores
• Sorting on graphs by adjacent swaps using permutation groups

Cited in

(1)

• An Improved Parallel Prefix Sums Algorithm

Describes a project that uses

Uses Software

• QuickHeapsort

This page was built for publication: Complexity analysis and performance of double hashing sort algorithm

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