9:40:28heisigbeach: Good question. I think it is just because they notice I am very enthusiastic about it. And I promised them it will make their life easier and their programs better.
9:59:12beachBucketsort is O(n), but not comparison sort.
9:59:31beachThe proof that comparison sort is at least O(n log n) is easy.
10:07:20Shinmeracomplexity analysis and proofs of sorts is one of the first things we did in our algorithms lecture.
10:09:19fiddlerwoaroofbeach: yeah, I know the proof
10:09:55fiddlerwoaroofThe sort in question relies on not doing the comparisongs
10:13:58no-defun-allowedheisig: somewhat irrelevant, I got my music exam back and I got a C. I won't complain, but I got higher marks on my other assessments but the C goes on my report.
10:14:47no-defun-allowedBucket sort also scales with how many digits your representation requires and I doubt the space complexity is low. It's quite amusing nonetheless.
10:16:16no-defun-allowedfiddlerwoaroof: they are on the fritz. Bogosort is the best sort nonetheless.
12:48:33beachHAH, SLOT-VALUE-USING-CLASS is a generic function that does not fit the general bootstrapping scheme I have implemented. In this scheme, there is an assumption that the arguments of a generic function are all of the same let's call it "category". Either they are all host object, all bridge objects, or all ersatz objects. But SLOT-VALUE-USING-CLASS takes an object as its second argument, and the class of that object as its first
12:48:33beachargument. So those two arguments are necessarily in different categories during bootstrapping.
12:49:20beachIt's not a big deal, of course. I can use the non-generic versions of SLOT-VALUE-USING-CLASS, and (SETF SLOT-VALUE-USING-CLASS) during bootstrapping.