- Calm is offering a lifetime membership for $160, a 60% discount for black friday. I just paid my renewal. This is a little over 3 years. I’ll hold off. Maybe next year I’ll wait to not resubscribe, then get lifetime.
- Supercontest. Made the email body only show the target(s) of the late pick message. Emails the admin separately with the same info, controllable by input boolean.
- Good FS article about how inaccurate performance reviews are: https://fs.blog/2019/11/performance-reviews-kill-culture/. A suggested alternative: have employees grade themselves relative to their old selves, not current peers.
- Farnam Street has a youtube channel. I’ll check out a bit of it.
- DS&A.
- Brute force is usually quadratic. Say you have an n-dimensional array. Check each item n against all other yields n^2 total permutations. Quadratic is bad. Only having to iterate over the whole thing once is better, linear. Doing something like a binary search is even better, logn.
- Most searches are O(logn). This includes binary search.
- Most sorts are O(nlogn). Quicksort usually a great option.
- Most space complexities are O(n) worst case, for both searches and sorts. Quicksort is O(logn).
- New m night shyamalan tv show! https://www.youtube.com/watch?v=ZaaQoutaEj8.