Slashdot Mirror


What's New With Data Structures In C#

prostoalex writes "Scott Mitchell published his rather extensive examination of data structures in C# 2.0 (parts 1, 2, 3, 4, 5 and 6 add up to more than a hundred printed pages)."

3 of 38 comments (clear)

  1. No Fibonacci Heap? by at2000 · · Score: 2, Insightful

    Does Microsoft think that we should implement Fibonacci Heap ourselves, but not AVL-tree?

    1. Re:No Fibonacci Heap? by rreyelts · · Score: 4, Insightful

      I'm hardly a Microsoft defender, but a fibonacci heap is anything but a common data structure. You'd most likely use one as a priority queue where extract-mins and decrease-keys are extremely common, but even then, lots of people still avoid them.

      On the other hand, AVL trees get used all over the place (red-black trees being a typical backing data structure for an ordered map).

  2. Kind of introductionary level by Frans+Faase · · Score: 4, Insightful

    Having read pages 1 and 6, I do not read anything beyond the introductionary level. It does not even seem to be rather C# specific for that matter. This is all stuff that people with a University degree in computer science should know by heart. The fact many of the readers rank it with a 9, says more about the readers than the quality of the page. People who do not understand the difference between a set and a list, should not even be allowed to be involved in any part of the development cycle of an arbitrary information system or computer application.