Random commentary about Machine Learning, BigData, Spark, Deep Learning, C++, STL, Boost, Perl, Python, Algorithms, Problem Solving and Web Search
Thursday, February 5, 2009
joining n segments
You are given n segments. In turn, you take each one of them and join it with one among those already selected, creating either a loop or a longer segment. How many loops there are in average, at every instant of time?
I like this one, because gives you basic idea of probabilities. At a given time, how many are the chance of making a loop? how many are the chance of not making a loop? You have two components and you can sum them, considering when you create an when you don't create a loop
I like this one, because gives you basic idea of probabilities. At a given time, how many are the chance of making a loop? how many are the chance of not making a loop? You have two components and you can sum them, considering when you create an when you don't create a loop
ReplyDelete