title: Sorting range of list using LINQ
body: <p>I was wondering if it is possible to do ranged sort using LINQ, for example i have list of numbers:</p>
  
  <p><code>List&lt; int &gt; numbers = new List&lt; int &gt;</code></p>
  
  <ul>
  <li>1</li>
  <li>2</li>
  <li>3</li>
  <li>15   &lt;-- sort</li>
  <li>11   &lt;-- sort</li>
  <li>13   &lt;-- sort</li>
  <li>10   &lt;-- sort</li>
  <li>6</li>
  <li>7</li>
  <li>etc.</li>
  </ul>
  
  <p>Simply using <code>numbers.Skip(3).Take(4).OrderBy(blabla)</code> will work, but it will return a new list containing only those 4 numbers. Is is somehow possible to force LINQ to work on itself without returning a new "partial" list or to receive complete one with sorted part?
  Thanks for any answer!</p>