Meetings: Attendees: Computer Scientists: Algorithms

Here's a list of the most notorious algorithmic attendees:

• Boolean Algorithms - Because who doesn't love true or false, right?
• Dynamic Programming - When you just can't be bothered with planning.
• Linear Algorithms - The most boring ones.
• Recursive Algorithms - Because recursion is fun!