|
|
|
|
|
by DamonHD
380 days ago
|
|
Here comes an unpopular nitpick: "... we traced the issue to a 15-year-old Git function with O(N²) complexity and fixed it with an algorithmic change, reducing backup times exponentially." Uh no you didn't. Not possible. At most a polynomial reduction is possible else complexity theory needs a re-write. (OK, yes, k could be doing some heavy lifting here, but I doubt it.) If you are going to quote a maths formula then please don't use "exponetially" to mean "lots". I stopped reading there: I don't want to have to read each word and wonder if they actually meant it, or it's just bad hype. |
|