Over a million developers have joined DZone.
{{announcement.body}}
{{announcement.title}}

Find All Permutations of string - C#

DZone's Guide to

Find All Permutations of string - C#

· Web Dev Zone
Free Resource

Get the senior executive’s handbook of important trends, tips, and strategies to compete and win in the digital economy.

Find All Permutations of string - C# 

// 1. remove first char

// 2. find permutations of the rest of chars

// 3. Attach the first char to each of those permutations.

// 3.1 for each permutation, move firstChar in all indexes to produce even more permutations.

// 4. Return list of possible permutations.


public string[] FindPermutations(string word)

{

if (word.Length == 2)

{

char[] _c = word.ToCharArray();

string s = new string(new char[] { _c[1], _c[0] });

return new string[]

{

word,

s

};

}


List _result = new List();


string[] _subsetPermutations = FindPermutations(word.Substring(1));

char _firstChar = word[0];

foreach (string s in _subsetPermutations)

{

string _temp = _firstChar.ToString() + s;

_result.Add(_temp);

char[] _chars = _temp.ToCharArray();

for (int i = 0; i

Read this guide to learn everything you need to know about RPA, and how it can help you manage and automate your processes.

Topics:
c# ,code snippet

Opinions expressed by DZone contributors are their own.

{{ parent.title || parent.header.title}}

{{ parent.tldr }}

{{ parent.urlSource.name }}