Quicksort

swMATH20694MaRDI QIDQ32511FDOQ32511

Author name not available (Why is that?)

Official website: https://en.wikipedia.org/wiki/Quicksort

Described by source

• On the adaptiveness of Quicksort
• Proof of a recursive program: Quicksort
• Quicksort

Cited In (only showing first 100 items - show all)

• Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm
• QuickhullDisk: a faster convex hull algorithm for disks
• A limit theorem for “quicksort”
• Quicksort algorithm: application of a fixed point theorem in intuitionistic fuzzy quasi-metric spaces at a domain of words
• Moves and displacements of particular elements in quicksort
• Distributional analysis of swaps in quick select
• The analysis of Quicksort programs
• The Orc Programming Language
• Towards a realistic analysis of the QuickSelect algorithm
• A study on interleaving versus segmentation
• The impact of random initialization on the runtime of randomized search heuristics
• Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme
• New applications of random sampling in computational geometry
• Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
• Distributional convergence for the number of symbol comparisons used by QuickSort
• Grail
• The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance
• PARTITION
• Knapsack
• MahonianStat
• MCSTL
• BPEL2oWFN
• RACT
• Orc
• HISTABRUT
• VTune
• EditorArrow
• Sparkle
• 2D triangulations
• EKHAD
• FSDA
• SMCper
• CMU Benchmarks
• GPU Quicksort
• SynchAADL2Maude
• Snugglebug
• GPUSort
• A minimal algorithm for the multiple-choice knapsack problem
• An efficient implementation of the Min-Min heuristic
• numericaluniversality
• GPU-ABiSort
• Networksort
• AMoRE
• MONACO
• QuickHeapsort
• L1PMA
• Find
• DAC
• DS2G
• stCore
• VeriFun
• MODENA
• gprof
• gbeta
• Algorithm 37
• Voldipar
• XCVMTest
• AS 102
• RLScore
• Ergodic theory
• QuickSort Cost
• Random BSTs
• Root Balanced Tree
• MaLiJAn
• MoMQuickMergesort
• MR-DBSCAN
• WikiSort
• apTreeshape
• QuickhullDisk
• DefunT
• UniDOE
• TXDT
• AS 266
• heapsort
• IMP2_Binary_Heap
• Algorithm 489
• Algorithm 347
• Monad normalisation
• Probabilistic_Prime_Tests
• ABCDepth
• Vdream
• TimSort
• MinPerim
• GPU computing of compressible flow problems by a meshless method with space-filling curves
• Asymptotic analysis of an optimized quicksort algorithm.
• Classification of time series by shapelet transformation
• Mixed Poisson approximation of node depth distributions in random binary search trees
• Optimal full ranking from pairwise comparisons
• Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
• Combinatorial analysis of quicksort algorithm
• QuickHeapsort, an efficient mix of classical sorting algorithms
• On Floyd and Rivest's SELECT algorithm
• Applying sorting networks to synthesize optimized sorting libraries
• On the total length of the random minimal directed spanning tree
• Computing inversion pair cardinality through partition-based sorting
• The total path length of split trees
• A language for generic programming in the large
• Weighted height of random trees
• BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)
• A fixed point theorem for distributions

This page was built for software: Quicksort