Complexity analysis and performance of double hashing sort algorithm

DOI10.1186/S42787-019-0004-2zbMATH Open1493.68130OpenAlexW2941856566MaRDI QIDQ2338136FDOQ2338136

Authors: Hazem M. Bahig 

Publication date: 21 November 2019

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

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

Recommendations

• The analysis of double hashing
• Smoothsort revisited
• Analyzing a class of distributive partitioning sort algorithms
• DUAL PIVOT QUICKSORT
• Improved average complexity for comparison-based sorting

zbMATH Keywords

quicksortsortingcomplexity analysisperformance of algorithmcounting sort

Mathematics Subject Classification ID

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

Cites Work

• QuickHeapsort: modifications and improved analysis
• On the adaptiveness of Quicksort
• Introduction to algorithms.
• Title not available (Why is that?)
• Randomized Shellsort
• Kinetic sorting and kinetic convex hulls
• Resource oblivious sorting on multicores
• An in-place sorting with O ( n log n ) comparisons and O ( n ) moves
• Inversion-sensitive sorting algorithms in practice
• Convex hull of points lying on lines in \(O(n\log n)\) time after preprocessing
• Sorting on graphs by adjacent swaps using permutation groups
• Optimal Partitioning for Dual-Pivot Quicksort
• Efficient sorting using registers and caches

Cited In (1)

• An Improved Parallel Prefix Sums Algorithm

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)