Lab program for ADA Lab

Common DS Algo in Python

An online repository of my solutions for the UC San Diego, Algorithmic Toolbox course on Coursera.

Coding solutions to multiple problems using different types of algorithms like Divide & Conquer, Greedy, and Dynamic Programming

This repository covers design principles, C++ class implementations and essential concepts for effective algorithmic problem-solving. It includes abstract data types, algorithm analysis, and advanced techniques with practical exercises and projects for real-world application.

Algorithms to calculate closest points in a plane in different languages

this repo created for analysis and design algorithm problem

OpenMP thread contention performance investigation for the EPCC11003 course.

Finds how similar 2 lists of rating are using the Divide and Conquer approach. Extension of MergeSort that actually displays the specific inversions as well as just counting the total number.

Proof Based Algorithms HW (CPSC 365) with Professor Andre Wibisono

Answers for exercises from the Design and Analysis of Algorithms course at the university. Discover efficient C++ implementations of algorithms, data structures, and problem-solving strategies.

Solutions of assignments in Algorithmic ToolBox Course from Coursera.

Algorithm studies.

Analysis of Algorithms II, Assignment II.

Closest Pair and Convex Hull

Templates of challenging algorithms.

Graphs, Connected Components, divide and conquer, dp, greedy

Convex Hull algorithm (Divide and conquer) implementation in Go.

Pracownia z AiSD (2024), Instytut Informatyki, Uniwersytet Wrocławski

Se abordan aquí dos formas (fuerza bruta y divide & vencerás) de obtener las inversiones de vectores tanto con contenido aleatorio como rellenado por el propio usuario con el fin de ver la duración de ambos métodos para así optar por el uso de uno y otro.