Java permutation algorithm

Question

So I have this code now, and in input I have in ascending order my name's letters "ahimrsu". I need to show up the right number for "mariush" from all combinations which should to be 2170. For now it only show ahimrsu, ahimrus, ahimsru, ahimsur, ahimurs, ahimusr, ahirmus, ahirmsu.... etc How can I do this?

<!DOCTYPE HTML>

<html>
<head>
<!--Script Function Start Here-->
<script type="text/javascript">
        function perms(data) {
    if (!(data instanceof Array)) {
        throw new TypeError("input data must be an Array");
    }

    data = data.slice();  // make a copy
    var permutations = [],
        stack = [];

    function doPerm() {
        if (data.length == 0) {
            permutations.push(stack.slice());
        }
        for (var i = 0; i < data.length; i++) {
            var x = data.splice(i, 1);
            stack.push(x);
            doPerm();
            stack.pop();
            data.splice(i, 0, x);
        }
    }

    doPerm();
    return permutations;
}

var input = "ahimrsu".split('');
var result = perms(input);
for (var i = 0; i < result.length; i++) {
    result[i] = result[i].join('');
}
console.log(result);
</script>
<!--Header start here-->
</head>
<body>
<!--Script Result-->
<script type="text/javascript">
    document.write(result);
</script>

</body>
</html>

I recomend you read about variations and permutations in general. — JBA
– JBA, Commented Oct 22, 2014 at 8:12
Now the second question that has the same amount of "quality". You should read stackoverflow.com/help/how-to-ask, before you ask the next question. — Tom
– Tom, Commented Oct 22, 2014 at 8:15

user3437460 · Accepted Answer · 2014-10-22 08:26:30Z

0

Your question is of mathematics nature - combinations and permutations. You are actually asking the number of possible permutation for string length 7. The formula is factorial(numOfchar).

In this case 7! = 7x6x5x4x3x2x1 = 5040.

public static void main(String[] args) {

    String str = "ABCDEFH";

    System.out.println("Number of permutations for " + str + " is : " + factorial(str.length()));
}


public static int factorial(int n)
{
    if (n == 0)
        return 1;

    int result = factorial(n-1)*n;
    return result;  
}

Program Output:

Number of permutations for ABCDEFH is : 5040

Since you tagged Java, this is one way you can get the it done with Java.

answered Oct 22, 2014 at 8:26

user3437460

17.5k18 gold badges67 silver badges110 bronze badges

Sign up to request clarification or add additional context in comments.

1 Comment

Marius Hincu Over a year ago

I tagged JAVA because I need to do it in JAVA thank you for your answer

Collectives™ on Stack Overflow

Java permutation algorithm

1 Answer 1

1 Comment

Your Answer

Linked

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

1 Comment

Your Answer

Sign up or log in

Post as a guest

Linked

Related