andreschuelein
Re:Quant Job Interview Questions (2009) [pdf]
on Saturday November 12, 2016 @08:09PM (#12941226)
-
edit: To explain, why not 0.5? Because the probability of your opponent having drawn a smaller number than 0.5 after two attempts is <0.5 and the probability of a larger number is >0.5. A strategy of keeping >=0.5 after the first draw will loose against the optimal strategy on average.
Re:TrackMania is NP-complete
on Friday May 13, 2016 @01:54PM (#11691985)
This is a nice write up. One thing though:
> Bubble sort is an example of an O(n^2) Algorithm[2], which means that if it takes 1 second to sort a list of size=10, then it will take roughly 10 seconds to sort a list of size=100.
It would take roughly 100 seconds to sort an array of size 100, if it would take 1 second to sort an array of size 10. (10 times the size ~ 10^2 times the time)