Closed jbafford closed 4 years ago
ACM would love to host this! I'll be contacting you!
@dctech/acm-dc
(still trying out teams as a way to tag potentially interested Meetups)
Hi there — thanks for submitting this talk! It’s been a year since the last activity — would you mind taking a look to see if you’re still interested in presenting about this topic, and if the talk’s content is still up-to-date?
If everything’s still good, just drop a comment here and I’ll pop back into hibernation like a good little robot.
If you’re no longer interested in giving this talk, or the talk is out-of-date, feel free to close this issue.
Should I not hear back in a week, I’ll close this issue so you needn’t feel guilty about it. ❤️
Thanks for your contribution to the tech community in DC!
Keep being awesome! 🤖✨
About You
Your Name: John Bafford
Twitter handle (optional): @jbafford
The best way to reach out to you: email: john at bafford dot com
A quick bio: John is a freelance software developer with over 20 years of experience in web, desktop, and mobile app development. He also enjoys long-distance hiking.
Your Talk
Title: Demystifying Algorithmic Complexity
What your talk is about: Complexity theory. Big-O. Constant, linear, logarithmic, and quadratic time versus space trade-offs. What does it actually mean when we say a function or an algorithm is efficient? How can we tell if we can do better? Join me, on this tour through a corner of computer science few developers actively think about, and you’ll walk away with a new way of looking at code and thinking about problems.
This talk is language-agnostic.
How long will your talk be?
Meta
Do you need help crafting your talk?
Previously Presented Versions of this talk have been given at php[tek] 2017, Nomad PHP, Midwest PHP 2018, and MidDevCon 2019.