I really appreciate the feedback you guys have offered so far. Some additional information:

There’s already been a fair amount of evaluating O(n) of an algorithm you’ve written (and, perhaps more importantly, the role things like caching, etc. can play in interefering in your theoretical stuff) in earlier classes.

This class has been extremely math-heavy and poorly run. I freely admit I struggle with the math proofs to start with; there’s very poor support and I’m tearing my hair out over it. In some ways, it feels like my time would be much better spent producing a portfolio program/reviewing some of the algorithms and their pros and cons/prepping for an interview.