User talk:Ethan McCue/sandbox

Chris DiNome Peer Review

In the "Persistent Hash Array Mapped Trie" section, you do a good job of introducing the data structure and linking to the wikipedia pages for relevant keywords and topics within your explanation.

I think you do a good job organizing the article, such as in the Usage in programming languages section. You are able to briefly breakdown how the data structure is used in many programming languages, which illustrates how each language takes advantage of the persistent data structures.

Overall, I think your sections are structured in an organized, clear way. My only main suggestion would be to make sure you use enough citations - there should be a citation for almost every sentence. On the whole though, I think this is a very good start.

The leaf nodes of the tree behave similar then to the buckets used to construct hash tables and may or may not contain multiple candidates depending on hash collisions. (I would delete the "then") GCSChris (talk) 16:54, 24 October 2018 (UTC)

Elena Dobryn Review

What does the article (or section) do well?

-clear, concise, informative, neutral language

-The usage in programming languages is an important addition

What changes would you suggest overall?

-very little changes needed, make sure everything is cited and proofread again, even though your language is pretty smooth

-you could maybe elaborate a little bit more on the programming languages if you feel like there is any more info to put there

What is the most important thing that the author could do to improve his/her contribution?

-pretty much already stated this above

Did you glean anything from your classmate's work that could be applicable to your own?

-I like how you went into an already build up article and found very specific sections to add. This makes it easier to concentrate your focus and source search .