DeMorgan's Law

!(A && B) is the same as !A || !B
!(A || B) is the same as !A && !B

Something cool to think about.

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

Searching Algorithms

Linear/Sequential Search A linear/sequential search algorithm looks at each element in the array until it finds what it's looking for. ...

  • Designing Classes
    Cohesion - a class is cohesive if it has a single, well-defined purpose. If the class has methods and instance fields that don't exactly...
  • Searching Algorithms
    Linear/Sequential Search A linear/sequential search algorithm looks at each element in the array until it finds what it's looking for. ...
  • DeMorgan's Law
    !(A && B) is the same as !A || !B !(A || B) is the same as !A && !B Something cool to think about.