Abstract
A new method to evaluate the number of cycles in random permutations and the height of random binary search trees is developed. The approach is based on certain number sequences that can be interpreted both by referring to permutations and trees. New bounds on the behavior of number of cycles in random permutations are obtained.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
