Update modular_inverse_fermat_little_theorem.cpp

hollowcrust · web-flow · commit 3e38166f0e53 · 2024-10-07T23:31:11.000+08:00
Add time complexity in comment
diff --git a/math/modular_inverse_fermat_little_theorem.cpp b/math/modular_inverse_fermat_little_theorem.cpp
@@ -78,7 +78,7 @@ std::int64_t binExpo(std::int64_t a, std::int64_t b, std::int64_t m) {
   return res;
 }
 /**
- * @brief Check if a given integer is a prime number.
+ * @brief Check if an integer is a prime number in \f$O(\sqrt{m})\f$ time.
  * @param m An intger to check for primality
  * @return true if the number is prime
  * @return false if the number is not prime

Original file line number	Diff line number	Diff line change
`@@ -78,7 +78,7 @@ std::int64_t binExpo(std::int64_t a, std::int64_t b, std::int64_t m) {`
`78`	`78`	`return res;`
`79`	`79`	`}`
`80`	`80`	`/**`
`81`		`- * @brief Check if a given integer is a prime number.`
	`81`	`+ * @brief Check if an integer is a prime number in \f$O(\sqrt{m})\f$ time.`
`82`	`82`	`* @param m An intger to check for primality`
`83`	`83`	`* @return true if the number is prime`
`84`	`84`	`* @return false if the number is not prime`