skip to main | skip to sidebar

greeness notes

Friday, October 17, 2008

Bit operations hacks

I find a few more interesting sites:

Bit Twiddling Hacks

The Aggregate Magic Algorithms

Posted by greeness at 3:13 PM
Labels: bit operation
Newer Post Older Post Home

Labels

  • dp
  • bit operation
  • c++
  • graph
  • search
  • design patterns
  • math
  • recursion
  • string
  • linux programming
  • backtracking
  • data structure
  • disjoint set
  • divide and conquer
  • jobhunting
  • linear algebra
  • matrix
  • sweeping

Blog Archive

  • ►  2009 (6)
    • ►  12 (1)
    • ►  11 (4)
    • ►  02 (1)
  • ▼  2008 (56)
    • ►  11 (9)
    • ▼  10 (25)
      • google c++ coding style
      • random programs
      • counting sort + bit operation
      • Maximum interval sum
      • initialize upon the first use
      • bit operation again SRM 422
      • closest pair problem
      • Bit operations hacks
      • Design Patterns (4) - Factory method and Abstract ...
      • Design Patterns (3) - Decorator
      • Design Patterns (2) - Observer
      • Design Patterns (1) - Strategy
      • interprocess communication IPC (2) - shared memory
      • interprocess communication IPC (1) - message queue
      • C++ notes
      • numeric_limits
      • C++ FAQ Lite
      • POSIX Thread
      • RPN and evaluation tree
      • Tree Recovery
      • Skill keywords in IT job-seeking website
      • gcd, binomial number
      • Prime Numbers
      • Flickr Photostream
      • Trie
    • ►  09 (22)
  • ►  2005 (33)
    • ►  06 (3)
    • ►  05 (1)
    • ►  04 (2)
    • ►  03 (6)
    • ►  02 (12)
    • ►  01 (9)