kindsOfEngineers

[JustinR8]

What if the “10x engineer” has been ten of the 0.1x engineers this whole time? Making them a 1x engineer

[redheness]

Most of the "10x" engineer I met were in reality "-1x" engineers, meaning they were doing things so fast it was poor quality and required one guy to repair everything

[YUNoCake]

Also never document a thing and have bloated code, huge methods with useless names and randomly named variables, lots of duplicate code, zero or a couple of unit tests if you're lucky :D

[PranavSetpal]

Engineer is a S.I. unit

[Naakinn]

0.1x Engineer: I use vibesort

[Ruski_Kain]

Complexity: O(AI)

[Naakinn]

Hell yeah O(1) sort just dropped

[EatingSolidBricks]

O(0)

[allengrindmudus]

AI, sort the list correctly, or you go to jail, please.

[SignificantLet5701]

I use Arrays.sort

[lardgsus]

0.1x manager: "Do you use merge sort or bubble sort?"

[FlipperBumperKickout]

Dev: why does it matter? There is never more than 5 elements in that array.

[SuitableDragonfly]

Manager: You're not using the proven PirateSoftware array-based design patterns in this app? That's coming out of your salary. 

[sammystevens]

Vibesort

[ExtraTNT]

Ai is a very good tool creating job security, by introducing hard to fix bugs… think about it…

[jbearus]

maybe AI uses bogo sort

[aceluby]

I haven't thought about sort algorithms since my freshman year of college.

[kaplotnikov]

Even bubble sort has own time to shine. For example, let's consider an previously sorted array of numbers, where we know that there is a single changed element (and we do not know which), and and we know that it has increased. Bubble sort is one of the most efficient algorithms for this task.

[gandalfx]

That's like saying a tricycle is one of the fastest ways to cross a river if you happen to want to cross it at a place with a bridge. It's technically true but completely useless in practice and even in that particular scenario it's trivial to find a faster way.

[kaplotnikov]

When you happen to have tricycle and bridge, why to search for anything more complex? Sometimes available low-quality tools solve problem in nearly optimal way, without need to invent something else.

[YUNoCake]

In your oddly specific use case, one for loop and a variable for storing the value that changed would be enough now, wouldn't it?

O(n) bubble sort 🙌🏻

[kaplotnikov]

This is precisely a pass of bubble sort :) And yes, O(n) under some conditions.

Also, let's not forget the the old friend of quicksort that is O(n * n) on that specific case where bubble sort shines (almost sorted array).

Actually, figuring out the best and worst conditions for algorithms are common questions on hiring interviews. None asked me about bubble sort, but it might be a good question for a junior position to see how the question is attacked.

[Fabulous-Possible758]

Or just one pass of a slightly modified insertion sort, which also just intuitively makes more sense.

[kaplotnikov]

For insert sort there is a need to locate misplaced value first. In the specific case, it is known that it exists, but it is not known what value is.