andrewp123··on There are only 3 data structuresThe article explicitly states that sorting is O(n log n), giving rise to log n per element. I think you missed that I'm talking about adding/removing/reading a single element at a time.
andrewp123··on There are only 3 data structuresI'm not sure if this is very obvious or very interesting. Let me know what you think (I wrote the article).
andrewp123··on Ivy League DemographicsHow is the average Jewish Mean Nationwide SAT score n/a? I would have liked to see that...