tag:blogger.com,1999:blog-6314876008291942531.post2349734013007436641..comments2024-01-14T00:36:43.430-08:00Comments on Antonio Gulli's coding playground: An array of integers sorted and shuffledUnknownnoreply@blogger.comBlogger1125tag:blogger.com,1999:blog-6314876008291942531.post-87981924644164208262009-03-24T23:50:00.000-07:002009-03-24T23:50:00.000-07:00The question of P( s[k]==k for some k) surprising...The question of P( s[k]==k for some k) surprisingly comes up all the time in hash tables and sorting. It's a surprising result to most people that the probability converges to a nice value (1-1/e) and doesn't depend much on the size of the population. It's sort of like the Birthday paradox in its "really!??" counter-intuitiveness.Anonymousnoreply@blogger.com