Notes of Algorithms Learning

Записките ми за упражнения по "Дизайн и анализ на алгоритми"

This repository contains all the solutions of assignments, starter files and other materials related to this specialization.

Strip Packing Written in C++

🧙🏾‍♂️ Complex Algorithms and Complexity Course from the University of San Diego

Homeworks done in course CS 599: Algorithms - Design, Analysis, and Implementations at Oregon State University

Presents a reduction from 3DM to Nonogram

Algorithms-Specialization from Stanford:

Course projects on various NP and NPH problems on CTU in Prague 2021. Knapsack problem with various approaches, analysis of effectivity and robustness. Instances generation and validation. Approximation algorithms (FPTAS) and advanced iterative methods (genetic algorithm, simulated annealing).

What I learned from Data Structures and Algorithms Specialization on Coursera.

Foundations of Computer Science

Non-Deterministic Objects library (CombView API)

Coursera Data Structures and Algorithms Specialization course 5 --> Advanced Algorithms and Complexity... Code is completed in python only.

This repo contains the implementation of an heuristic to solve the Traveling Tournament Problem (TTP), as well as the implementation of the Meta-heuristics' algorithm Iterated Local Search (ILS) satisfying the predefined contraints of the NP-hard problem.

The aim of the course is to provide a solid knowledge on how to design and analyse the most important classes of algorithms.

Repositório da cadeira de Análise e Projeto de Algoritmos

Algorithm Analysis and Development

An implementation of an A* Informed Search Algorithm for solving the N-Puzzle problem, using several heuristic functions, written in C

Karp's 21st problem, called the Maximum Cut Problem, implemented into Java