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

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

mi diverto a implementare cosine

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.

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:

Solving subset sum problem by backtracking and Approximation approach

Here are some dynamic programming problem solutions.

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

A solver for the subset sum problem

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.

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

Subset Sum Problem

Approximation and randomized algorithms - Assignment 02 - Subset Sum

Subset Sum Problem - Analisis for Aproximation Algorithms

Recursive DFS solver for subset sum problem.

No description provided.

This is a C program that computes subset sums for all possible cardinalities

A fast heuristic algorithm for solving high-density variants of the subset-sum problem

Implementation of Different Advanced Algorithms

Comparison of Subset Sum Algorithms: Brute Force vs. Dynamic Programming.

An structured attempt at a Polynomial -Time Solution to the NP-complete Subset Sum Problem.

Implementation of Brute force, Dynamic Programming, & Clever Algorithm to solve SubsetSum problem.

A collection of classic algorithms and data structure implementations in Java. Features solutions to complex computational problems including Tiling, Subset Sum variants, Sudoku solving via backtracking, and practical demonstrations of HashMap mechanics, custom hash code behaviors, and collision handling.

Coding Problems based on recursion

Knapsack and Subset Sum algorithms from my university course "Algorithms and Data Structures 2"