r

Binary Search

A binary search is a great way to find the sweet spot between two extremes. When designing this site I did a lot of that. Is this font too small? Let’s make it giant. Then let’s make it in between. Then let’s make it in between the next two. I kept going until I got the right size, spacing, and shade of grey.

This works for behavior too. Are you too nice? Become an asshole. Too much of an asshole? Go halfway. Still too nice? Go halfway between that as well.

Another way of doing it is through an incremental search. But doing incremental searches can take too long. How much do you increment each time? How do you increment niceness?