On: Knuth: Computer Programming as an Art (1974)

[Someone]

Change the constant.

Change the x that the big O is about, for example by using vector instructions.

Implement a theoretically less efficient algorithm that is faster (examples: switch to a O(n^2) sort for small data set, or to a linear search for smallish arrays)

[kazinator → Someone]

Use data with a smaller size N, and do something more interesting with it.

[crimsonalucard → Someone]

would the procedures you describe be classified as an artistic endeavor?