|
|
1-10 of 112
< Previous Next >
|
There should be an overload for arrays instead of IList<T> to avoid 3 virtual calls when swapping 2 elements. Swapping is a critical operations in algorithms and should be implemented efficiently.
id# 6160 | Planned Release: None | Last Updated: Sep 15 at 2:17 AM
by pelikhan
It seems that a 'RemoveMinimum' or something related is missing from the List API. Currently one has to 1) get the element at index 0, 2) remove it. it's not really easy to use.
id# 6159 | Planned Release: None | Last Updated: Sep 15 at 1:59 AM
by pelikhan
Why do you have a constrain that T is IComparable<T>? It would be more efficient to simply take a Comparison<T>, which works for any T and let the user provide the logic.
id# 6158 | Planned Release: None | Last Updated: Sep 14 at 10:58 PM
by pelikhan
id# 5161 | Planned Release: 1.0 | Last Updated: Sep 12 at 5:20 PM
by gbarnett
Algorithms to sort singly and doubly linked lists.
id# 5162 | Planned Release: 1.0 | Last Updated: Sep 12 at 5:20 PM
by gbarnett
To be further defined.
id# 5163 | Planned Release: 1.0 | Last Updated: Sep 12 at 5:19 PM
by gbarnett
id# 5164 | Planned Release: 1.0 | Last Updated: Sep 12 at 5:19 PM
by gbarnett
id# 5165 | Planned Release: 1.0 | Last Updated: Sep 12 at 5:19 PM
by gbarnett
id# 5166 | Planned Release: 1.0 | Last Updated: Sep 12 at 5:19 PM
by gbarnett
In order to keep consistency, make sure you don't use 'null' when meaning to use the null zero character. An example is at line 11 of the Remove algorithm for the BST.
id# 5861 | Planned Release: None | Last Updated: Sep 12 at 5:18 PM
by gbarnett
|
|
1-10 of 112
< Previous 1 2 3 4 5 6 7 8 9 10 ... Next >
|
|
|
|
