Algorithm for finding all subsets consisting of n elements of one set?

A

A

afishr2015-11-07 22:46:36

Pascal

afishr, 2015-11-07 22:46:36

Algorithm for finding all subsets consisting of n elements of one set?

Give an example of a program/algorithm for finding all subsets of n elements of one subset.
PS The length of the set is set by the user, the set consists of capital letters of the Latin alphabet.
Thanks in advance!

Reply

Answer the question

Answer the question

In order to leave comments, you need to log in

0 answer(s)

Similar questions

L

Livesms2016-12-25 00:47:26

Wirth N. Algorithms and data structures - Pascal vs Modula-2 vs Oberon? 0Reply

T

tuccar2015-01-14 11:31:53

Have you read this article? What do you think of it? 5Reply

A

A1lexen2017-02-08 13:19:08

How to solve a problem without arrays, Pascal? 1Reply

M

mbcsoft2015-02-13 21:36:18

How to send emoticons for the minimum number of operations? 2Reply

E

Egor Alekseev2015-02-18 03:53:44

Can't convert byte to array? 0Reply

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question