#include <Sorting.h>
Euclidean algorithm using modulo policy.
Definition at line 160 of file Sorting.h.
◆ GCD()
Calculate GCD.
- Parameters
-
A | First parameter. |
B | Second parameter. |
- Returns
- Greatest common divisor of A and B.
Definition at line 171 of file Sorting.h.
The documentation for this class was generated from the following file:
- C:/Users/lachl/Downloads/ArkServerAPI_NEW/ASE/AseApi-main/version/Core/Public/API/UE/Templates/Sorting.h