YARB (Yet Another Rails Blog)

Tuesday, October 9, 2012

Knap Sack

If the set is {1,2,3} how do I get target 4.

No algorithm that can solve it correctly.

Look hard to find counter examples.

Posted by ridingwithrails at 4:09 PM

Email This BlogThis!Share to X Share to Facebook Share to Pinterest

No comments:

About Me

ridingwithrails

View my complete profile

Popular Posts

Graphs Adjacency Lists

http://sourcecodemania.com/graph-implementation-in-cpp/ for details on implementation in C++. An issue that you man encounter when...
Graph to Adjancency Matrix

Graph Structures I have always wondered how to represent Graphs when programming. The answer came in the form of a Adjancy Matr...
Red Black Trees

So, you can get screwed if you have to construct (insert operation) based on Sorted Data. You can get a highly unbalanced tree. How to sol...
Oh Oh O!

Log N is essentially how many times you halve n. the log is the power (the exponent of the base number). OR The number of times you d...
Knap Sack

If the set is {1,2,3} how do I get target 4. No algorithm that can solve it correctly. Look hard to find counter examples.
BackTracking

The simplest explanation of this technique just sunk in for me so I thought I would put it up before I completely forget it. So, it works ...
Selecting a datastructure

When faced with selecting a data structure: Look at the operations to perform closely. INSERT, SEARCH, SORT What is likely the most co...
Over Estimation of big O

It is likely that we can over estimate the big O and get stuck with the upper bound when in fact the average case is more important. Dynam...
QuickSort

http://en.wikipedia.org/wiki/Quicksort The boxed element is the pivot element, blue elements are less or equal, and red elements are la...
Merge Sort

goo.gl/d1wyx Merge Sort Points: Divide and Conquer (and combine): Divide unsorted list into 2 sub lists. Sort sub lists rec...