Let us take as yinfeng.zhang.9's solution as a example. What is the time complexity of it?

Why do you guys avoid talking about the time complexity? Is it too trivial or too difficult to analyze?

public List<List<Integer>> getFactors(int n) {

List<List<Integer>> result = new ArrayList<List<Integer>>();

helper(result, new ArrayList<Integer>(), n, 2);

return result;

}

public void helper(List<List<Integer>> result, List<Integer> item, int n, int start){

if (n <= 1) {

if (item.size() > 1) {

result.add(new ArrayList<Integer>(item));

}

return;

}

```
for (int i = start; i <= n; ++i) {
if (n % i == 0) {
item.add(i);
helper(result, item, n/i, i);
item.remove(item.size()-1);
}
}
```

}