Ternary Operator and Boolean
I have asked a question on stackoverflow: inline int test(int n, int tag, int flag) { if (0 == flag) return ((n & tag) == tag); return ((n & …
Category: optimization
C/C++ Coding Exercise – Recursive Computation of Value e
September 5, 2014
algorithms, beginner, c / c++, code, code library, math, optimization, programming languages, recursive, tricks
1 Comment
We all know the formula to compute value e (mathematical constant that is the base of the natural logarithm) is e = 1 + 1/1！+ 1/2！+ .....+ 1/n！ Now, …
C/C++ Coding Exercise – Unique Paths II – Dynamic Programming with Obstacles – Leetcode Online Judge – DP with Constraints
March 23, 2014
algorithms, c / c++, code, dynamic programming, implementation, leetcode online judge, math, optimization, programming languages
No Comments
The Dynamic Programming DP is one of the most-used approach to solve problems that satisfy the overlapping sub-problems and the optimal substructures. The simplest example is to compute Fibonacci …
C/C++ Coding Exercise – Unique Paths – LeetCode Online Judge – Dynamic Programming – Recursive Formula
March 17, 2014
algorithms, c / c++, code, code library, dynamic programming, leetcode online judge, math, optimization, programming languages
No Comments
Remember a couple days ago, I write a solution to this puzzle using Dynamic Programming (DP)? The DP solution helps to avoid duplicate computation in the sub-problems (smaller size). …
Coding Exercise – C ++ – Solve Integer Split using Dynamic Programming – 3 Implementation
November 10, 2013
algorithms, c / c++, code, computational theory, dynamic programming, implementation, math, optimization, programming languages
No Comments
Question: Given an integer (maximum 100), compute the number of distinct ways to split the number using non-negative integer numbers. For example, given 5, there are 7 ways to …