Enhancement of gcd for polynomials in the sparse representation

This project aims to enhance SymPy's GCD computation speed for polynomials in the sparse representation. I will implement Zippel's algorithm from scratch and finalize the integration of the sparse subresultant PRS algorithm. Subsequently, I will develop a benchmarking suite to evaluate all SymPy's GCD algorithms. The resulting data will serve a new heuristic-based dispatcher, ensuring SymPy selects the optimal strategy for any given input.