Repository of the course Algorithmic Fundamentals, which is part of the University Program Software Engineering in Universidad Complutense de Madrid (UCM).
-
Updated
Sep 15, 2023 - C++
Repository of the course Algorithmic Fundamentals, which is part of the University Program Software Engineering in Universidad Complutense de Madrid (UCM).
An implementation of the Radix-2 Decimation-In-Time (DIT) form of the Cooley-Tukey FFT algorithm, as well as its inverse. The algorithm is used to multiply 2 polynomials and compute the convolution of 2 vectors in O(nlogn) time.
Advanced algorithms course (SCC0218).
Add a description, image, and links to the divide-and-conquer-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the divide-and-conquer-algorithms topic, visit your repo's landing page and select "manage topics."