I have downloaded a solution for this problem and all it does is sum the length of cycles > 1. What is the logic behind this? Is n the expected number of hits to sort a n-element array? How to derive this?
-- You received this message because you are subscribed to the Google Groups "google-codejam" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/google-code?hl=en.
