News for hackers. Stuff that matters.
Re:Learn Big-O and stop hacking your way through algorithms by dvt on Thursday August 20, 2020 @06:40PM (#24229858)
Oh look another Triplebyte article that makes to the top of HN while also being completely devoid of useful information -- and, in fact, quite wrong.

> The truth is, Big-O is just the name of the notation used to describe how efficient an algorithm is.

The truth is that this is absolutely unequivocally unabashedly WRONG. Big O (there's no dash, first of all), describes the behavior of some function f as f tends to infinity (but we can actually look at Big O when f approaches arbitrary values, as well). The "O" in Big O references the function order of the limiting function --, e.g. logarithmic, quadratic, cubic, and so on. If you're going to make a hubbub about truly understanding Big O, at least get the math bits right.

> Learning about how they work without understanding the associated implications of time and space complexity misses the point.

Some fresh grad probably wouldn't realize how laughable this claim really is, but seasoned developers do. 99.9% of times you don't care (or even understand; some are quite hairy) about the (micro-)optimizations found inside standard library functions or data structures.

> It's like memorizing dates in roman history without having heard of Julius Caesar...

Yeesh, capitalize "Roman" please. What a low-quality trash-heap of an article.

> And on top of making learning easier, understanding the point of Big-O (and algorithms in general) will seriously help you avoid mistakes in interviews.

Ah yeah, here we go. Finally, we get to the only practical use case of Big O unless you're a CS PhD: getting through interviews.

Overall, this is a zero effort pseudo-marketing blog post that hasn't been researched, edited, or proof-read. It's all so Triplebyte can make the top of HN, get a bit of traffic, and keep reinforcing horrible interviewing practices that don't work. I swear, one of these days I'm going to write a book about how to actually do a good job of interviewing software engineers.

Re:Learn Big-O and stop hacking your way through algorithms by phkahler on Thursday August 20, 2020 @06:53PM (#24229960)
>> I swear, one of these days I'm going to write a book about how to actually do a good job of interviewing software engineers.

Same, except I can fit mine in a blog post. Tripplebyte got on here a few years ago and wanted people to conduct technical interviews so I started to sign up / apply. Then they wanted me to take their javascript test... I've never written js, nor would that have much if any bearing on my ability to interview software candidates.

Re:Learn Big-O and stop hacking your way through algorithms by tzs on Friday August 21, 2020 @12:08AM (#24231874)
> Big O (there's no dash, first of all)

NIST disagrees [1]. It is in common use both with and without the dash in both CS and math. Looking around in various books I downloaded from Springer when they made nearly 400 books free for a couple of months in response to COVID, I see several that include the dash.

Laczkovich and SoS, "Real Analysis"

de Berg, Cheong, van Kerveld, and Overmars, "Computational Geometry"

Lee and Hubbard, "Data Structures and Algorithms with Python"

Borthwick, "Introduction to Partial Differential Equations"

Paar and Pelzl, "Understanding Cryptography"

Haubold an Borsch-Haubold, "Bioinformatics for Evolutionary Biologists"

[1] https://xlinux.nist.gov/dads/HTML/bigOnotation.html

Re:Learn Big-O and stop hacking your way through algorithms by dvt on Friday August 21, 2020 @02:07AM (#24232456)
> NIST disagrees

I'd say whoever wrote the NIST article is wrong because there's absolutely no grammatical reason to hyphenate, but that's a minor nit.

Re:Learn Big-O and stop hacking your way through algorithms by danielwbean on Thursday August 20, 2020 @06:53PM (#24229964)
Eck. Sorry about the copyediting error on "roman." Fixed! Thanks for the callout.