The Simple Tutorial to Disjoint Set (Union Find Algorithm)
Disjoint Sets is one of the most powerful and yet simple data structure. The idea of Disjoint Sets can be perfectly applied in finding the minimal spanning tree. The …
Introduction to Complete Knapsack Problem
November 28, 2012
algorithms, beginner, Dynamic Programming, greedy algorithm, Knapsack Problems, math
No Comments
In , the basic 0/1 knapsack is discussed. For each item, you can choose to put or not to put into the knapsack. Therefore, for the number of items, …
How Programmer Reads Your CV?
Different people have different opinions… For programmers, experiences matter more than degrees.. –EOF (The Ultimate Computing & Technology Blog) — 59 words The Permanent URL is: How Programmer Reads …
Optimal SizeOf Code Generated in Delphi 2007
November 26, 2012
assembly language, beginner, compiler, delphi, implementation, interpreter / compiler, profiler, programming languages, tools / utilities, tricks
No Comments
In Delphi, you can use SizeOf to get the size of a type or any variable. The SizeOf function returns the storage size, in bytes, of either a Variable …
Introduction to 0/1 Knapsack Problem
November 14, 2012
algorithms, dynamic programming, Dynamic Programming, Knapsack Problems, math
No Comments
In reality, many applications can be represented as Knapsack problems. The knapsack problem is one of the most classic combinatics mathematics problems. The knapscak problems are of serveral types. …
Codeforces: B. Spreadsheets
November 11, 2012
algorithms, beginner, codeforces, implementation, math, programming languages, python
No Comments
The problem is from codeforces: http://www.codeforces.com/problemset/problem/1/B The implementation may not be so easy without Regual Expressions. The core idea is to provide conversion between base 10 and base 26. For …