coursera - [no description]

Age	Commit message (Collapse)	Author	Files	Lines
2013-07-03	Discrete : 01-knapsack: compute capacity loop lower_bound	Jérémy Zurcher	1	-2/+13
	- reduce by 50% the iteration count when items are sorted by value or weight - global 2% speed up only as loop does nothing realy
2013-07-03	Discrete : 01-knapsack: add sort capability to ks_dp-ng.c	Jérémy Zurcher	1	-2/+101

2013-07-03	Discrete : 01-knapsack: start speed seach => ks_dp-ng.c	Jérémy Zurcher	2	-0/+242

2013-07-03	Discrete : 01-knapsack: add correct output reference	Jérémy Zurcher	1	-0/+54

2013-07-03	Discrete : 01-knapsack: tighten loop bounds	Jérémy Zurcher	1	-2/+11

2013-07-03	Discrete : 01-knapsack: optimize memory mgmt for items	Jérémy Zurcher	1	-34/+31

2013-07-03	Discrete : 01-knapsack: 1 vector + bit fields + pointer arithmetic	Jérémy Zurcher	1	-128/+154

2013-07-03	Discrete : 01-knapsack: dynamic programming solver + malloc error when to ↵	Jérémy Zurcher	3	-33/+226
	many values
2013-07-03	Discrete : add 01-knapsack assignment	Jérémy Zurcher	23	-0/+13418