will this check for permutation ?
What is worst case analysis of this algorithm and is it linear big O(n)  ??





      for(int i =0; i  < a.length; i++)
		{
			s.add(a[i]);
			
			System.out.println(a[i]);
			int number = a[i];
			Real = Real* number;
			expected = expected*(i+1);
		}

will this check for permutation ?
===

What is worst case analysis of this algorithm and is it linear big O(n)  ??





      for(int i =0; i  < a.length; i++)
		{
			s.add(a[i]);
			
			System.out.println(a[i]);
			int number = a[i];
			Real = Real* number;
			expected = expected*(i+1);
		}
