very very nice blog! very well explained algorithms and codes are just as they should be, near, compact, and unbloated! please , pleaase keep on writing! =)
This is a fantastic blog, a shame you do not keep it updated anymore. I’m working on some parallel shortest-path problems, and your blog has been extremely helpful.
2008-01-15 at 15:11
Was wondering if you could help me with a knapsack problem for my online class. Thanks.
2008-01-17 at 17:13
I can try. What do you need?
2008-03-05 at 13:56
:)
2009-01-27 at 3:57
very very nice blog! very well explained algorithms and codes are just as they should be, near, compact, and unbloated! please , pleaase keep on writing! =)
2009-04-10 at 12:13
you’re doing a holy job
thanks man
2009-09-09 at 4:51
This is a fantastic blog, a shame you do not keep it updated anymore. I’m working on some parallel shortest-path problems, and your blog has been extremely helpful.
2009-11-10 at 12:09
Hello to you, can i have your email contact ?
I have read your website about the Lexicographic permutation generation algorithm.
1. Why it is largest index in the first step ?
If you loop from backward at last second element until to 0 and it is sorted, then the index will be zero.
Can you explain ?
Thanks.