{"id":25517,"date":"2017-10-15T19:05:42","date_gmt":"2017-10-15T13:35:42","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=25517"},"modified":"2017-10-15T19:05:42","modified_gmt":"2017-10-15T13:35:42","slug":"write-program-print-permutations-given-string-4","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/write-program-print-permutations-given-string-4\/","title":{"rendered":"JAVA Programming-Write a program to print all permutations of a given string"},"content":{"rendered":"

A permutation, also called an \u201carrangement number\u201d or \u201corder,\u201d is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. A string of length n has n! permutation.<\/span>
\nSource: Mathword(http:\/\/mathworld.wolfram.com\/Permutation.html<\/a>)<\/p>\n

Below are the permutations of string ABC.
\nABC ACB BAC BCA CBA CAB<\/p>\n

Here is a solution that is used as a basis in backtracking.<\/p>\n

\"Write<\/p>\n

JAVA Programming<\/strong><\/p>\n

Java<\/span> <\/div> 
\/\/ Java program to print all permutations of a\/\/ given string.public class Permutation{    public static void main(String[] args)    {        String str = "ABC";        int n = str.length();        Permutation permutation = new Permutation();        permutation.permute(str, 0, n-1);    }     \/**     * permutation function     * @param str string to calculate permutation for     * @param l starting index     * @param r end index     *\/    private void permute(String str, int l, int r)    {        if (l == r)            System.out.println(str);        else        {            for (int i = l; i <= r; i++)            {                str = swap(str,l,i);                permute(str, l+1, r);                str = swap(str,l,i);            }        }    }     \/**     * Swap Characters at position     * @param a string value     * @param i position 1     * @param j position 2     * @return swapped string     *\/    public String swap(String a, int i, int j)    {        char temp;        char[] charArray = a.toCharArray();        temp = charArray[i] ;        charArray[i] = charArray[j];        charArray[j] = temp;        return String.valueOf(charArray);    } }<\/code><\/pre> <\/div>\n
Output:<\/strong><\/p>\n
ABC\r\nACB\r\nBAC\r\nBCA\r\nCBA\r\nCAB<\/pre>\n

\nAlgorithm Paradigm: <\/strong>Backtracking
\nTime Complexity: <\/strong>O(n*n!) Note that there are n! permutations and it requires O(n) time to print a a permutation.<\/p>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
JAVA Programming-Write a program to print all permutations of a given string – Searching and Sorting – A permutation, also called an \u201carrangement number\u201d or \u201corder,\u201d is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. <\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1,2139,71670,83549],"tags":[73701,73700,73693,73699,70384,73690,73692,73707,73696,73713,73703,73708,73682,73710,73702,73057,73685,73686,73687,73718,73680,73697,73148],"class_list":["post-25517","post","type-post","status-publish","format-standard","hentry","category-coding","category-java","category-searching-and-sorting","category-strings","tag-permutation-in-java","tag-permutation-in-python","tag-permutation-of-string","tag-permutation-of-string-in-java","tag-permutation-program-in-c","tag-permutation-questions","tag-permutations-of-a-string","tag-permutations-python","tag-print-all-permutations-of-a-string","tag-print-list-python","tag-python-combinations","tag-python-itertools-combinations","tag-python-language-example","tag-python-list-unique","tag-python-permutations","tag-python-print-list","tag-recursion-examples","tag-recursion-in-python","tag-sample-python-script","tag-simple-python-script","tag-string-permutation","tag-string-permutation-java","tag-string-programs-in-c"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25517","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=25517"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25517\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=25517"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=25517"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=25517"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}