Sort a list alphabetically
You should be able to use OrderBy
in LINQ...
var sortedItems = myList.OrderBy(s => s);
You can sort a list in-place just by calling List<T>.Sort
:
list.Sort();
That will use the natural ordering of elements, which is fine in your case.
EDIT: Note that in your code, you'd need
_details.Sort();
as the Sort
method is only defined in List<T>
, not IList<T>
. If you need to sort it from the outside where you don't have access to it as a List<T>
(you shouldn't cast it as the List<T>
part is an implementation detail) you'll need to do a bit more work.
I don't know of any IList<T>
-based in-place sorts in .NET, which is slightly odd now I come to think of it. IList<T>
provides everything you'd need, so it could be written as an extension method. There are lots of quicksort implementations around if you want to use one of those.
If you don't care about a bit of inefficiency, you could always use:
public void Sort<T>(IList<T> list)
{
List<T> tmp = new List<T>(list);
tmp.Sort();
for (int i = 0; i < tmp.Count; i++)
{
list[i] = tmp[i];
}
}
In other words, copy, sort in place, then copy the sorted list back.
You can use LINQ to create a new list which contains the original values but sorted:
var sortedList = list.OrderBy(x => x).ToList();
It depends which behaviour you want. Note that your shuffle method isn't really ideal:
- Creating a new
Random
within the method runs into some of the problems shown here - You can declare
val
inside the loop - you're not using that default value - It's more idiomatic to use the
Count
property when you know you're working with anIList<T>
- To my mind, a
for
loop is simpler to understand than traversing the list backwards with awhile
loop
There are other implementations of shuffling with Fisher-Yates on Stack Overflow - search and you'll find one pretty quickly.
Another way
_details.Sort((s1, s2) => s1.CompareTo(s2));
There are two ways:
Without LINQ: yourList.Sort();
With LINQ: yourList.OrderBy(x => x).ToList()
You will find more information in: https://www.dotnetperls.com/sort