B Brian Gideon Dec 13, 2005 #21 Brian said: I forgot to mention that I provide a skip list as well. Click to expand... Doh...it's at <http://www.gotdotnet.com/Community/...mpleGuid=3F773D8A-7E1A-40F2-8EC0-48FB811989AA>.
Brian said: I forgot to mention that I provide a skip list as well. Click to expand... Doh...it's at <http://www.gotdotnet.com/Community/...mpleGuid=3F773D8A-7E1A-40F2-8EC0-48FB811989AA>.
B Brian Gideon Dec 14, 2005 #22 Brian said: Actually, Add and Remove on the SortedList are O(n log n) implementations. Click to expand... Correction. It's O(n) according to the documentation.
Brian said: Actually, Add and Remove on the SortedList are O(n log n) implementations. Click to expand... Correction. It's O(n) according to the documentation.
B Brian Gideon Dec 14, 2005 #23 Brian said: You can use the SortedList, but it is horribly inefficient on inserts and deletes since it uses O(n log n) implementations. Click to expand... Correction. It's O(n) according to the documentation.
Brian said: You can use the SortedList, but it is horribly inefficient on inserts and deletes since it uses O(n log n) implementations. Click to expand... Correction. It's O(n) according to the documentation.
