Categories

JavaScriptPHPHTMLCssPythonWordPressWeb developmentLinuxMySQLAndroidWindowsJavaC++ / C#LayoutReactUbuntuYiiDjangoProgramming1C-BitrixLaravelSystem administrationTelegramJSONDebianPostgreSQLIOSGoogleHtaccessWindows ServerGitMacOSGoogle ChromeCMSWooСommerceBootstrapNginxSQLUnityAPI
Make a leaderReport
A
A
AlexWWW_012015-11-08 17:35:42
Programming
AlexWWW_01, 2015-11-08 17:35:42

How to find all subsets using backtracking?

In general: There is a set (array) which consists of capital letters of the Latin alphabet. The length of the set is set by the user (no more than 26). It is necessary to find all subsets that consist of N elements using the backtracking method.
At least a simple example program :)

Reply
Answer the question

Answer the question

In order to leave comments, you need to log in

0 answer(s)
Similar questions
E
Egorithm2016-06-16 16:37:02
Why is there a minus in bit shifts? 3Reply
G
Gena2016-06-17 09:34:55
Are there platforms to build your own website analytics service? 2Reply
N
No Name2016-06-17 18:07:30
What approaches, methodologies, technologies do you need to know to ensure website security? 4Reply
A
Alexander Garelkin2016-06-18 15:27:19
Does a programming language developer create only a standard? 3Reply
L
Lena2016-06-19 12:01:52
What IT platforms can be used to promote the school of young programmers? 1Reply

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question