Viewing profile — andreschuelein

- 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. A strategy of keeping >=0.5 after the fi…

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…