Data wrangler, software engineer, systems programmer, cyclist. Unix (mostly Solaris) for aeons. I talk C, Python, SQL, Performance, Java, Kafka and Makefiles.
Location
Brisbane, Australia
Education
BA (Mathematics, Modern History), University of Queensland
A minor niggle - I had to re-read your comment about the prework adding an extra loop iteration, because of the way you expressed it.
You had O(n*2), which my brain read as O(n^2), so seeing the comment about dropping constants was jarring. If you'd expressed it as O(2*n) or O(2n) it would have been much more mathematical and the comment would have flowed.
As to whether we need to take account of time complexity in day to day work - that depends on what your problem space is :-)
Valid point with the 2*nn*2 thing, I changed it to 2*n. Thanks for the feedback.
Yeah, maybe I'll work with something that requires thinking more about time complexity in the future. But I think most people are like me, and work with things that rarely creates the opportunity to utilize any knowledge of time complexity.
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
A minor niggle - I had to re-read your comment about the prework adding an extra loop iteration, because of the way you expressed it.
You had
O(n*2), which my brain read asO(n^2), so seeing the comment about dropping constants was jarring. If you'd expressed it asO(2*n)orO(2n)it would have been much more mathematical and the comment would have flowed.As to whether we need to take account of time complexity in day to day work - that depends on what your problem space is :-)
Valid point with the
2*nn*2thing, I changed it to2*n. Thanks for the feedback.Yeah, maybe I'll work with something that requires thinking more about time complexity in the future. But I think most people are like me, and work with things that rarely creates the opportunity to utilize any knowledge of time complexity.