Source code for the book "Quantum Computing for Programmers", Cambridge University Press

Leverage the power of modern C++ to build robust and scalable applications

A solver for the 0-1 Knapsack Problem

A Faster Pseudopolynomial Time Algorithm for Subset Sum http://arxiv.org/pdf/1507.02318v1.pdf

Solves subset sum problem and returns a set of decomposed integers.

SubSet Sum Problem Implementation

Solving the popular NP problem, The Subset Sum Problem, with an Amortized O(n) algorithm based on Recursive Backtracking. The Algorithm stood second fastest in the organized Intra-University competition.

mi diverto a implementare cosine

Solving subset sum problem by backtracking and Approximation approach

ToWear is an application that suggests outfits to users from their closets based on the weather. We use linear regression to personalize the results to each user. Check out the current state of the app here:

This repository is all about various concepts related Dynamic Programming.It also contains solutions to problems from various online judges, organized by topic.

Here are some dynamic programming problem solutions.

A Python Implemented Cryptographic Algorithm Which Utilizes Public, Private Key Cryptography to Provide Congruent Super-Increasing Sets for Encryption of Data. This Algorithm relies on the SUBSET-SUM Problems NP Difficulty.

Another subset sum problem solution in natural numbers.

A university project in which the following problems are solved in Java language and also have a graphical appearance using JavaFX

Given a pool of lego blocks and an image, this codeset solves the combinatorics to recreate the image in block-form.

Subset Sum Problem

Recursive Depth-First Search (DFS) algorithm solution to the knapsack problem hand-written in C.

Subset Sum Problem - Analisis for Aproximation Algorithms

Approximation and randomized algorithms - Assignment 02 - Subset Sum