3 ms·
While it seems like you're moving goalposts, this example also appears to be something a person could know without touching on nested loops or O(n) at all. Cas
by rhizome 13y ago
While it seems like you're moving goalposts, this example also appears to be something a person could know without touching on nested loops or O(n) at all.
Case in point, 10s of Googling produced this link:
http://stackoverflow.com/questions/2831212/python-sets-vs-lists http://stackoverflow.com/questions/2831212/python-sets-vs-li... ...and I don't even use Python yet.
- recursive 13y agoIs it possible to write working code without understanding O()? Definitely. Is it helpful to understand? Definitely.
- rhizome 13y agoOf course, but neither was your point. You were rebutting that algo & bintree knowledge are unnecessary in the vast majority of companies, in favor of the pursuit of O(n) knowledge in candidates. None of your examples validated this, and "should" became merely "helpful."
- recursive 13y agoI suppose I considered it reasonable to consider things that are helpful should be done.