You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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 text was updated successfully, but these errors were encountered:
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 text was updated successfully, but these errors were encountered: