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
A
Alexey Nikolaev2014-10-08 10:59:23
How to decrypt encrypted php file? 3Reply
C
Chvalov2014-10-08 21:02:17
C# WinForm project does not exit completely after switching between forms, how to solve? 4Reply
H
HelpME HelpMNE2020-11-30 18:56:57
How to find a function by points in Scilab? 1Reply
R
Raul Abdullin2014-10-12 19:18:17
What tools are needed for layout on retina? 4Reply
A
Aitym Ramazanov2014-10-13 06:58:14
I am making a logic game. How to save player achievements? 1Reply

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question