Can anyone offer a linguistic explanation for the following phenomenon related to pronoun case and partial determiners:
- None of us want to go to school tomorrow.
- None of we want to go to school tomorrow (**).
- We want to go to school tomorrow.
- Us want to go to school tomorrow (**).
Subscribe to RSS Feed
= f037147d6e6c911a85753b9abdedda8d)
Has anyone studied the Red Black Tree algorithms recently? I've been trying to implement them using my Finite State technique that enables automatic generation of flow diagrams. This has been working well for several other algorithms.
But the Red Black tree rebalancing algorithms seem ridiculously complicated. Here is an image of the deletion process (extracted from this Java code) - it's far more complicated than an algorithm like MergeSort or HeapSort, and that only shows the deletion procedure!
I'm weighing two hypotheses:
I'm leaning toward the latter theory. It seems to me that most of the other "elementary" algorithms of computer science are comparatively simple, so the weird overcomplexity of the tool we use for binary tree balancing is some kind of oversight. Here is the Wiki page on RB trees - notice how the description of the algorithm is extremely hard to understand.