DislikedObviously as n gets large, probability decreases. not 93.75%. (Please correct me if my code is wrong.) If our data size is 10000, that is n^2=10000 and n=100, then the number of combinations of (n+1) increasing or decreasing sequence is 495100. That is very large. My coding skill is very limited and I have no idea how to handle this. Thank you and have a nice sunday, edit: I smell something about sub-sequence theorem, but not eureka yet.Ignored
The theorem stated that clearly!!! Good work though