Search
Wednesday, 14th of November 2018, 22:10:08 UTC
5:23:59
beach
Good morning everyone!
5:24:08
no-defun-allowed
morning beach!
9:24:00
heisig
ACTION just returned from teaching Common Lisp to a group of very motivated students.
9:30:55
beach
Hello heisig. Congratulations! How did you manage to motivate them?
9:33:07
splittist
ACTION assumes through fear (:
9:40:28
heisig
beach: 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:40:53
beach
Interesting. How big a group?
9:41:26
heisig
About 15-20 master students.
9:49:54
fiddlerwoaroof
There's this person that keeps claiming that there's a O(n) sort
9:50:40
fiddlerwoaroof
https://pdfs.semanticscholar.org/7e49/0023f84845c750f4a04b7dca8a0225d3e5d1.pdf
9:56:21
shka_
no pseudocode of any sort
9:59:12
beach
Bucketsort is O(n), but not comparison sort.
9:59:31
beach
The proof that comparison sort is at least O(n log n) is easy.
10:07:20
Shinmera
complexity analysis and proofs of sorts is one of the first things we did in our algorithms lecture.
10:09:19
fiddlerwoaroof
beach: yeah, I know the proof
10:09:55
fiddlerwoaroof
The sort in question relies on not doing the comparisongs
Thursday, 15th of November 2018, 10:10:08 UTC