Pages that link to "Item:Q4928334"

The following pages link to UPPER BOUNDS FOR SORTING PERMUTATIONS WITH A TRANSPOSITION TREE (Q4928334):

Displaying 2 items.

• Tighter upper bound for sorting permutations with prefix transpositions (Q497672) (← links)
• Sorting permutations with transpositions in \(O(n^3)\) amortized time (Q1731847) (← links)