| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428046 | Information Processing Letters | 2009 | 5 Pages |
Abstract
We use an interesting recent result of probabilistic flavor concerning the product of two permutations consisting of one cycle each to find an explicit formula for the average number of block interchanges needed to sort a permutation of length n.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
