Divide-and-conquer ray tracing
-
Updated
Feb 13, 2021 - Cuda
Divide-and-conquer ray tracing
Repository of the course Algorithmic Fundamentals, which is part of the University Program Software Engineering in Universidad Complutense de Madrid (UCM).
Data Structures and Algorithms
🐍 Python implementation to find the closest pair of points in a three-dimensional space
Implementation for different algorithms analyzing their performance (Big O Notation) and category.
Executing important algorithms using java
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.
Projects in Java and Python from class assignments
Implementations of introductory Data Structures and Algorithms in Python
🐍 Python implementation to find the closest pair of points in a three-dimensional space
Several problems about the Design and Analysis of Algorithms.
Graph, Greedy, Divide-and-Conquer and NP-Complete algorithms.
Done Java lessons from College
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."