Dragons in the Algorithm
Adventures in Programming
by Michael Chermside

How Useful is Big-O?

Here is a question I was answering on Reddit recently:

Say you have 2 algorithms and you determine both are O(log n) (or anything else that's the same). Does this mean both algorithms are just as good as one another?

Absolutely not. One algorithm might run 30x faster than …

Read more

Posted Sun 17 July 2022 by mcherm in Programming

Candidates for the May 2022 Primary

This Tuesday we have a primary election coming up here in Pennsylvania. I've reviewed the candidates on the Democratic ballot in my locale and here are my thoughts on the candidates.

Governor:
  • Josh Shapiro (lever 21) - [endorsed]
    • The sole candidate running.
    • my rating: 5

United States Senator:
  • Alex Khalil (lever …

Read more

Posted Tue 17 May 2022 by mcherm in Politics

Getting Accepted at SECON

SECON is Capital One's internal software conference. It is held once a year (it's been done remotely during the covid-19 pandemic) and has a good number of speakers from across the company. I have spoken before at SECON, but this year I did something different: I was one of the …

Read more

Posted Sat 19 June 2021 by mcherm in Career

Unreasonable Legal Agreements

I've been looking at a few financial companies lately, and I wanted to talk about some clauses I consider unreasonable that are found in the legal agreements they expect you to click through. I mean, I'm sure that nearly everyone clicks through these sorts of things without reading them (much …

Read more

Posted Thu 28 January 2021 by mcherm in Law