Generating all possible permutations of the string

This generates all possible permutations of the string. I am also unable to understand the time complexity of this problem. Can someone please explain the complexity to me?

import java.util.ArrayList;

public class permutations {

    public ArrayList performPermutations(String s){
        ArrayList arrayList = new ArrayList();
        if (s == null) {
            return null;
        }

        else if (s.length() == 0) {
            arrayList.add("");
            return arrayList;
        }

        else {
            for (int i = 0; i  remaining = performPermutations(s.substring(0, i) + s.substring(i + 1));
                for (int j = 0; j  arr = p.performPermutations("abcde");
            for(int i = 0; i<arr.size();i++) {
                System.out.println(arr.get(i));
            }
        }
    }
}

There are quite a few ways this code can be improved:

-
All class names should start with a capital, and be in CamelCase. Specifically, the class permutations should be Permutations. The way it doesn't look like a variable, as in here:

permutations p = new permutations();

performPermutations method

-
Why does it declare a return type of ArrayList? Is there anything special about the implementation of the list? It should just be List.

-
You have an unnecessary if-else structure, since each if statement returns a value. You can remove all of the elses.

-
In the first if statement, you return null. This is a bad idea in many cases. An empty list would be more favorable, just in case any calling code wants to operate on it immediately afterwards. (Notice that your main method would fail with a NullPointerException if the passed in list was empty).

-
You can combine the first and second if statements into one. This would be your "base" case:

if (s == null || s.isEmpty() { return arrayList; }

Never compare a list length to 0, use isEmpty() instead. Also, s is a poor name for a method parameter. Try to be creative and descriptive. Finally, there's no need to add an empty string if the list is empty.

-
There's a lot of existing posts on string permutations you may find interesting. Seeing a recursive call embedded in two for loops is probably unnecessarily complex.

How this method could look (but can still be improved):

public List performPermutations(final String s){

    final List result = new ArrayList();

    if (s == null) {
        return result;
    }

    for (int i = 0; i  remaining = performPermutations(s.substring(0, i) + s.substring(i + 1));
        for (int j = 0; j < remaining.size(); j++) {
            result.add(s.charAt(i) + remaining.get(j));
        }
    }

    return result;
}

StackExchange Code Review Q#63220, answer score: 3