title: Bubble sort using recursion in C#
body: <p>I've wrote this simple piece of code. And I have a slight problem with it.</p>
  
  <pre><code>int [] x = [50,70,10,12,129];
  sort(x, 0,1);
  sort(x, 1,2);
  sort(x, 2,3);
  sort(x, 3,4);
  
  for(int i = 0; i &lt; 5; i++) 
   Console.WriteLine(x[i]);
  
  static int [] sort(int [] x, int i, int j)
  {
     if(j ==x.length) 
        return x;
     else if(x[i]&gt;x[j])
     {
        int temp = x[i];
        x[i] = x[j];
        x[j] = temp;
        return sort(x, i, j+1);
      }
      else 
         return sort(x, i, j+1);
  }
  </code></pre>
  
  <p>I feel that calling sort 4 time isn't the best soultion. I need a way to handle this using sort() also. I also ask you for your advice, suggestion, or tip. 
  Thanks</p>