Considering the permutation
(6 7 4 5 1 2 3 8)
it is correct to affirm that:
a) it is sortable by just applying Algorith 1 from Bergeron, 2005
b) does not contain hurdles
c) has 2 oriented pairs
d) is sortable by applying 3 reversions
e) None of the above
Original idea by Mario Akita
Answer:
ResponderExcluirD
a) is false since you cannot apply algorithm 1 on positive permutations
b) 1 2 3 is a hurdle
c) there are no oriented pairs
d) By reversing 6 7 4 5 you get the framed interval 0 -5 -4 -7 -6 1 2 3 8 9 which is order-able by algorithm 1 in 2 reversions:
by choosing pair (-7,8) we get 0 -5 -4 -3 -2 -1 6 7 8 9 and then we reverse (-5, 6) that will give us the ordered pair 0 1 2 3 4 5 6 7 8 9