Stephen Paul Weber posted, “Slide says algo is O(n). I point out it’s O(n^2). Prof: sure, but less than exponential so whatever. #CS486 #uwaterloo” @ 2012-30 13:59 UTC Leave a Response Name Email Website Comment Authenticate this comment using OpenID. Get replies via e-mail