Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Litter Patrol
Congratulations! You're submitting your assignment!
Comprehension Questions
this.state
connected?Compare how React and Rails' views differ. Given different circumstances, these systems have different goals. How does this impact on their design and how we are supposed to use them? |
What was a challenge you were able to overcome on this assignment? | It was challenging understanding the code at the beginning, specifically how ItemIcons was being called and used in the program.
CS Fundamentals Questions
App.render
(it starts withthis.state.items.map
). What is the Big-O time complexity of this code, where n is the number of active game items?Consider what happens when React processes a state change from
setState
-- it must re-render all of the components that now have different content because of that change.What kind of data structure are the components in, and what sort of algorithms would be appropriate for React's code to "traverse" those components?
Speculate wildly about what the Big-O time complexity of that code might be. | It comes in as a tree data structure because the DOM's structure is a tree. A homemade algorithm is used to transverse the tree in Reach: The Diffing Algorithm. The Big-O of that code is linear because it has to check through all the components (all the nodes are visited).