Services
Technology Web App Development Mobile App Development Windows App Development Database Development UI/UX Development Cloud Development SEO Digital Marketing Guest Posting Content Writing Artificial Intelligence Data Science ERP Development CRM Development CMS Development LMS Development Business Listing Blockchain Technology Startup Promotion
Products
Data Converter Cleaner TUC - Unit Converter Import Export Survey Manager Tweet Controller
Developer
Article Blog Forum Interview Beginner News Startup Quiz
Users
Career
Apply Job Internship
Pricing
Login Sign Up Get a Quote

forum

home / developersection / forums / implement a program to generate all possible permutations of a given string.
Ask Question

Implement a program to generate all possible permutations of a given string.

Utpal Vishwas 269 14 Jun 2023

Implement a program to generate all possible permutations of a given string.

c# c#stringprograms
Updated 15 Jun 2023
Utpal Vishwas
Utpal Vishwas

Student

I am Utpal Vishwas from Uttar Pradesh. Have completed my B. Tech. course from MNNIT campus Prayagraj in 2022. I have good knowledge of computer networking.

Message

1 Answers

Aryan Kumar
Aryan Kumar 15 Jun 2023
Report Abuse

Sure, here is the C# code to implement a program to generate all possible permutations of a given string:

C#

using System;

public class Permutations
{
    public static IEnumerable<string> Permute(string str)
    {
        if (str.Length == 1)
        {
            yield return str;
        }
        else
        {
            for (int i = 0; i < str.Length; i++)
            {
                string prefix = str.Substring(0, i);
                string suffix = str.Substring(i + 1);
                foreach (string perm in Permute(suffix))
                {
                    yield return prefix + perm;
                }
            }
        }
    }

    public static void Main(string[] args)
    {
        string str = "ABC";
        foreach (string perm in Permute(str))
        {
            Console.WriteLine(perm);
        }
    }
}

This program first checks if the given string is of length 1. If it is, then the program simply yields the string back. Otherwise, the program iterates through all the characters in the string. For each character, the program calls the Permute() function recursively to generate all possible permutations of the remaining characters. The results of the recursive calls are then combined to generate all possible permutations of the original string. The Main() method then prints all the possible permutations of the string to the console.

advertising