The basic implementation of MinTable::inOrder() uses recursion and copying of the Coxeter element at every step. We can avoid the recursion and the extra copying by making an entry point which makes one copy and then uses an iterative version of the check. We can also do a similar improvement to the one which records the positions.
The basic implementation of
MinTable::inOrder()uses recursion and copying of the Coxeter element at every step. We can avoid the recursion and the extra copying by making an entry point which makes one copy and then uses an iterative version of the check. We can also do a similar improvement to the one which records the positions.