An other Good Problem

Revision en1, by M_H_M, 2016-04-14 18:53:55

Hello :)

Consider permutation p from 1 to N
Every permutation has a decomposition to decreasing substrings.
Step : Reverse all decreasing substrings.
Prove or disprove that p will be sorted after N steps.

Tags combinatorics


  Rev. Lang. By When Δ Comment
en1 English M_H_M 2016-04-14 18:53:55 251 Initial revision (published)