complexity theory - Naming of an algorithmic antipattern -


I am having trouble remembering the name of something with quadratic complexity, when it can be sorted linearly is.

For example, instead of using a front-element instead of using a received-by-index function to repeat on a linked list Use is the typical example of this anti.

I think it was "some painter", as a metaphor for a person who is painting a street but does not take a paint bucket with it and every time it has to come back to the starting point

Cheers.

You're probably thinking about it.

There is a classic joke on the subject that Joel Spolsky had included in his article some years ago:

Shilil gets a job Road painter, Painting the dotted lines in the middle of the road On the first day, she can paint out of the road and can distance the distance of 300 yards of the road. "He's so good!" Your boss says, "You're a fast worker!" And gives him a kupak.

The next day Shalemile is done at only 150 yards. "Well, this is not nearly as good as yesterday, but you're still a fast worker. The distance of 150 yards is respectful," and gives him a kupak.

The next day, Sheilael paints 30 yards of the road "only 30!" Kisses your boss "It's unacceptable! On the first day you worked ten times more! What's going on?"

"I can not help it," Shilil says, "Every day I can be further away from the paint!"

P.S. Do not confuse with this, which is a real way to make pictures.


Comments