Did I find the right examples for you? yes no

# sympy.combinatorics.permutations.Permutation.unrank_nonlex

All Samples(6)  |  Call(6)  |  Derive(0)  |  Import(0)
```This is a linear time unranking algorithm that does not
respect lexicographic order [3].

Examples
========

>>> from sympy.combinatorics.permutations import Permutation
>>> Permutation.print_cyclic = False
>>> Permutation.unrank_nonlex(4, 5)
Permutation([2, 0, 3, 1])(more...)
```

```    raises(ValueError, lambda: p.get_precedence_distance(Permutation([])))

a = [Permutation.unrank_nonlex(4, i) for i in range(5)]
iden = Permutation([0, 1, 2, 3])
for i in range(5):
```
```    prank = p.rank_nonlex()
assert prank == 1600
assert Permutation.unrank_nonlex(7, 1600) == p
qrank = q.rank_nonlex()
assert qrank == 41
assert Permutation.unrank_nonlex(7, 41) == Permutation(q.array_form)
```

```    raises(ValueError, lambda: p.get_precedence_distance(Permutation([])))

a = [Permutation.unrank_nonlex(4, i) for i in range(5)]
iden = Permutation([0, 1, 2, 3])
for i in range(5):
```
```    prank = p.rank_nonlex()
assert prank == 1600
assert Permutation.unrank_nonlex(7, 1600) == p
qrank = q.rank_nonlex()
assert qrank == 41
assert Permutation.unrank_nonlex(7, 41) == Permutation(q.array_form)
```