Pages that link to "Item:Q1950265"

The following pages link to Distributional convergence for the number of symbol comparisons used by QuickSort (Q1950265):

Displaying 11 items.

• Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm (Q261384) (← links)
• The number of bit comparisons used by quicksort: an average-case analysis (Q428664) (← links)
• On the distribution of comparisons in sorting algorithms (Q1115198) (← links)
• Distributional convergence for the number of symbol comparisons used by QuickSelect (Q2837754) (← links)
• The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract). (Q2920867) (← links)
• A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms (Q2957920) (← links)
• Revisiting calculation of moments of number of comparisons used by the randomized quick sort algorithm (Q2966500) (← links)
• QuickSelect Tree Process Convergence, With an Application to Distributional Convergence for the Number of Symbol Comparisons Used by Worst-Case Find (Q3191202) (← links)
• The Number of Symbol Comparisons in QuickSort and QuickSelect (Q3638078) (← links)
• Towards a Realistic Analysis of Some Popular Sorting Algorithms (Q5364228) (← links)
• Dependence and phase changes in random <i>m</i>‐ary search trees (Q5739094) (← links)