[GAP Forum] Details on order computation with GAP

[Bors Alexander]

Dear GAP Forum,

For theoretical complexity considerations/comparisons, I would be interested to know how GAP's built-in algorithm for order computation, called via Order (discussed in Subsection 31.10-10 in the manual), proceeds to compute the order of an automorphism alpha of a finite pc group G, where alpha is defined via its images on the presentation generators of G (through a call of GroupHomomorphismByImages).

Since the manual does not seem to give details on this, is there any way to find out other than diving into GAP's source code? Thank you very much for your answers.

Best wishes,
Alexander