title: Finding the first n largest elements in an array
body: <p>I have got an array containing unique elements. I need to find out the first n largest elements in the array in the least complexity possible. The solution that I could think of so far has a complexity of O(n^2).</p>
  
  <pre><code>    int A[]={1,2,3,8,7,5,3,4,6};
      int max=0;
      int i,j;
      int B[4]={0,0,0,0,};//where n=4;
       for(i=0;i&lt;A.length();i++)
         {
           if(A[i]&gt;max)
            max=A[i];
         }
       B[0]=max;
       for(i=1;i&lt;n;i++){
         max=0;
         for(j=0;j&lt;A.length();j++){
           if(A[j]&gt;max&amp;&amp;A[j]&lt;B[i-1])
              max=A[j];
         }
          B[i]=max;
       }
  </code></pre>
  
  <p>Please, if anyone can come up with a better solution which involves less complexity, I will be highly grateful. And I don't intend to change the original array!!</p>