Message from C, C++ discussions
November 2019
— It's in Worst case
Its not remotely constant space, as you spawn a new search for each element across the entire array (stack usage is also counted, so are array elements). Nor is it O(n) nor an approximation. :P
— Https://www.geeksforgeeks.org/n3-repeated-number-array-o1-space/
— 👍👍👍
— Whats is your openion for this correct or incorrect? Tell AmAn
— What do you mean?
—
— You could've googled one second.
— That you even list python shows you didnt look at any results:
https://benchmarksgame-team.pages.debian.net/benchmarksgame/index.html
— That's a holywar question, at least "which one is better" part
— None of the above. lol
— And its not pure speed that matters. You also have to take into account:
how fast you can develop.
Is it sufficiently fast for your needs (users/requests per second/scalable)
etc.