How to Pass a Programming Interview

Re:How to Pass a Programming Interview by zimbu668 on Tuesday March 08, 2016 @02:15PM (#11247717)

Maybe I'm missing something but isn't N+1 the difference between O(1) and O(n)?

Edit: Anyone want to explain how I'm wrong rather than just downvoting?

Edit 2: Understanding a N+1 problem is the equivalent of understanding the difference between O(1), i.e. fetch all data with a constant number of queries, versus O(n), i.e. the number of queries scales linearly with the number of elements.

[ Parent | on HN ]

Re:How to Pass a Programming Interview by brobinson on Tuesday March 08, 2016 @03:09PM (#11248163)

It's this: https://secure.phabricator.com/book/phabcontrib/article/n_pl...

[ Parent | on HN ]

Re:How to Pass a Programming Interview by zimbu668 on Tuesday March 08, 2016 @03:17PM (#11248236)

Yes, and when you solve your N+1 problem, you've replaced a O(n) algorithm with a O(1) algorithm.

[ Parent | on HN ]

Re:How to Pass a Programming Interview by skj on Tuesday March 08, 2016 @03:11PM (#11248184)

Because your question makes so little sense that it seems sort of like a joke.

[ Parent | on HN ]

Re:How to Pass a Programming Interview by zimbu668 on Tuesday March 08, 2016 @03:17PM (#11248240)

Thanks for your comment, I've tried to clarify things.

[ Parent | on HN ]