mi diverto a implementare cosine
-
Updated
May 30, 2023 - C
mi diverto a implementare cosine
Parallel MPI implementation of Bruteforce and Divide et Impera approaches to solve the Closest Pair of Points problem leveraging the HPC infrastructure provided by the University of Trento
Algorithms that can be used in problems, interviews and more. *in case you don't understand romanian you can translate it easily
This problem set served as the first assignment for the "Algorithm Design" course, covering the following algorithms: Divide et Impera, Greedy and Dynamic Programming. ~ Year II
Visual algorithm presenter - visualizing data structures and algorithms through animations
Course: Algorithms design. Topic: Problem solving. Languages: C++ and Java. Programming techniques: Divide et Impera, Greedy, DP. Graph algorithms: minimum distances, topological sort.
Four interesting algorithmic problems efficiently solved in C and C++ with the help of classic algorithm schemes (Divide et Impera, Greedy, dynamic programming).
Add a description, image, and links to the divide-et-impera topic page so that developers can more easily learn about it.
To associate your repository with the divide-et-impera topic, visit your repo's landing page and select "manage topics."