Perm. | Algorithm | N
S
| N
T
| Exec. time |
|---|
A, ℐ8 d = 8 | all (A ↔ ℐ8) | 81, 869 | 377 | ≃ 5 s |
| | prf(A ↔ ℐ8) | 51,304 | 92 | ≃ 5 s |
| | prg (A → ℐ8) | 11, 568 | 12 | ≃ 3 s |
| | prg (ℐ8 → A) | 8, 400 | 5 | ≃ 2 s |
B, ℐ16 d = 12 | all (B ↔ ℐ16) | 505, 634, 256 | 21, 902 | ≃ 7.3 m |
| | prf (B ↔ ℐ16) | 122, 862, 960 | 171 | ≃ 27 s |
| | prg (B → ℐ16) | 5, 963, 760 | 6 | ≃ 14 s |
| | prg (ℐ16→ B) | 5, 393, 520 | 9 | ≃ 16 s |
- The experimental results of computing traces (all), perfect traces (prf) and progressive perfect subtraces (prg; in both directions), considering the pairs of permutations (A, ℐ8) and (B, ℐ16), where A = (-5, -2, -7, 4, -8, 3, 6, -1) and B = (-12, 11, -10, -1, 16, -4, -3, 15, -14, 9, -8, -7, -2, -13, 5, -6).
- The columns N
S
and N
T
give, respectively, the resulting number of sorting sequences and traces for each approach. All algorithms are part of the BAOBABLUNA package [22]. Experiments were made on a 64 bit personal computer with two 3GHz CPUs and 2GB of RAM and the execution time is given in seconds (s) or minutes (m).
