![]() I can see some optimizations, but for now it's helps me. I'm looking for something more iteractive, then I implement my poor version. ![]() Reversing this sequence in step 4 then produces its lexicographically minimal permutation, and the lexicographic successor of the initial state for the whole sequence Step 2 finds the smallest value a to replace a by, and swapping them in step 3 leaves the sequence after position k in weakly decreasing order.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |