Common data collection algorithms in C #

Question

Is there a library of common data collection algorithms for .NET? I would like to write something like this:

IList<T> items = GetItemsFromSomeWhere();
Algorithms<T>.Sort(items);
//
// ....
//
T item = GetItemSomwHow();
int i = Algorithms<T>.IndexOf(items, item);

Note that itemsnot List<T>, otherwise I could just use the List<T>.Sortand methods List<T>.BinarySearch.

Of course, I can implement them myself, I just do not want to reinvent the wheel.

I would also like the implementation to be effective.

PS

Please do not tell which collections to use. I perfectly understand the abilities Arrayor List<T>. I need a library of algorithms to work with any collection based on IList<T>.

EDIT: Found what I needed - see my own answer.

Answer 1

PowerCollections Wintellect.

Algorithms , BinarySearch<T> SortInPlace<T>, IList<T>.

Answer 2

System.Linq.Enumerable class . , , .

Answer 3

,.NET BinarySearch, IList<T>.

Linq , . IList<T> SO.

, Linq, , .

Answer 4

:

. .

sort() IList . :

int[] sortingArray = { 12, 5, 2, 7, 66 };
IComparer<int> comparer = new SortComparer();
sortingArray.Sort(SortStrategy.HeapSort, comparer);

, .

Answer 5

Array (Sort IndexOf).

:

IList<string> foo = new List<string>();
foo.Add("hi");
foo.Add("bye");
string[] foo_temp = new string[foo.Count];
foo.CopyTo(foo_temp, 0);
Array.Sort<String>(foo_temp);
foo = new List<string>(foo_temp);

Answer 6

LINQ OrderBy.

Answer 7

IndexOfKey SortedList < > .

Answer 8

, . , , , , . ? . Linq .NET , .

Answer 9

. Reflector, List.Sort Array.BinarySearch IList<T>.

, (, # 2), :

Algorithms<T>.Sort(items);

Sort ( ) Algorithms, , :

Algorithms.Sort(items);