Table 1.
Computation results for each pair of permutations (the number of elements and reversal distance of each pair is given in the first column).
| PERMUT. | Algorithm | NS | NT | Execution time |
|---|---|---|---|---|
| πA, I12 | enumSol | 8 278 540 | − | ≃ 13.5 min |
| n=12, d=10 | traces | 8 278 540 | 2151 | ≃ 27 sec |
| perfTrcs | 1 698 480 | 12 | ≃ 4 sec | |
| prgSubt | 453 600 | 3 | ≃ 2 sec | |
| πB, I16 | enumSol | 505 634 256 | − | ≃ 16 h |
| n=16, d=12 | traces | 505 634 256 | 21 902 | ≃ 7.3 min |
| perfTrcs | 122 862 960 | 171 | ≃ 27 sec | |
| prgSubt | 5 963 760 | 6 | ≃ 14 sec | |
| Rfe, R2 | enumSol | 546 840 | − | ≃ 42 sec |
| n=12, d=9 | traces | 546 840 | 13 | ≃ 3 sec |
| prgSubt | 263 088 | 6 | ≃ 2 sec | |
| X, Y | enumSol | 31 752 | - | ≃ 5 sec |
| n=12, d=8 | traces | 31 752 | 6 | ≃ 1.3 sec |
| strSubt | 420 | 1 | ≃ 0.5 sec |
The columns NS and NT give, respectively, the number of sorting sequences and traces computed by each algorithm. Experiments were made on a 64 bit personal computer with two 3 GHz CPUs and 2 GB of RAM.