Sorting range of list using LINQ

Question

I was wondering if it is possible to do ranged sort using LINQ, for example i have list of numbers:

List< int > numbers = new List< int >

• 1
• 2
• 3
• 15 <-- sort
• 11 <-- sort
• 13 <-- sort
• 10 <-- sort
• 6
• 7
• etc.

Simply using numbers.Skip(3).Take(4).OrderBy(blabla) 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!

Answer 1

Try something like this:

var partiallySorted = list.Where(x => x < 11)
                 .Concat(list.Where(x => x >= 11 && x <=15).OrderBy(/*blah*/)))
                 .Concat(list.Where(x => x > 15));

Answer 2

List<int> list = new List<int>() {1,2,3,15,11,13,10,6,7};
list.Sort(3, 4,Comparer<int>.Default);