How to iterate over all possible combinations of n objects?

Question

Algorithms

Good afternoon, I'm trying to write a program that would go through all possible combinations of n objects, or more specifically, we have an array containing integers without repetitions. For example, from [1,3,2] and you need to get a list of arrays [1,3,2], [1,2,3], [2,1,3] and so on
, I can’t figure out how to do this, but in the textbooks found only how to calculate the total number of such combinations. Please tell me where you can find similar algorithms and/or their implementations in programming languages

Answer 1

their implementation in programming languages

C++, for example (see Possible implementation): next_permutation

Answer 2

Recently answered this question, How to make all unique sequences from a one-dimensional array?

Answer 3

Try looking here www.cyberforum.ru/cpp-beginners/thread676321.html