Hi All, I had written a Bezout’s identity function (before I knew Julia already had one in the form of gcdx), and although my implementation is very close to the one that comes with Julia, I see that the inbuilt function is some ~50x faster than mine. Here are the 2 functions, and the results. All …

That’s not the gcdx that’s called for BigInt, check with @edit gcdx(big"1", big"1"): julia> @which gcdx(big"1", big"1") gcdx(a::BigInt, b::BigInt) in Base.GMP at gmp.jl:616 julia> @edit gcdx(big"1", big"1") #<new editor opens up> function gcdx(a::BigInt, b::BigInt) …

Huge performance difference between inbuilt gcdx() and my function

General Usage Performance

msravi June 22, 2021, 8:09am 4

Ah, I see! Thank you, @Sukera and @kristoffer.carlsson That explains it.

Topic		Replies	Views
Why is python faster than Julia Performance	14	1975	March 12, 2020
How is factorial(BigInt) so fast? Performance	10	2404	November 5, 2018
Memory consumtion Rational{BigInt} on bernoulli number example Performance	14	887	January 27, 2020
How to combine binary GCD and DIV in a mutable function New to Julia	1	228	February 23, 2023
Bitshifting using GMP.MPZ Performance	7	664	April 11, 2023

Huge performance difference between inbuilt gcdx() and my function

Related topics