Why this is fast: You have only two loops with N iterations, where N delimits the number of elements, so that is of complexity O(N) . The hash access is considered O(1) . So whole complexity is linear.
Nested loop iteration would be O(N^2) .
I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.