Sunday, January 13, 2008

programming pearls

1. the use of bitmap for counting when memory is unlimited
2. the find of substrings with maximum sum with recursive and O(N) complexity
3. rotate a string with reversal function

0 Comments:

Post a Comment

<< Home