[derycklong]

Hi, i have this homework which requires me to write a code with reference to O(N!) time complexity.

I have seen O(N^2), O(LOGN) but not with factorial.
Any advice? Please dont hook me up with tutorials with only n^2,n,1,logn only because i already googled all of them.

      
 public void run(int n) {
      for(int i=1; i<=n; i++) {
            run(n-1);
      }
}

Gave this to the automarker but it never went through.

This post has been edited by derycklong: 18 October 2010 - 04:43 AM

[macosxnerd101]

Permutation generation algorithms run in O(n!). Try writing an algorithm to generate all the possible permutations given an array of characters.