Follow

Accessing the akashic records to sort a linked list in O(1/n) time.

· · Web · 2 · 3 · 2

@trickster It gets faster as the number of elements increases? woah

gross, biocomputing 

@luna we need that computer that has all components made out of biological circuits so we can make it trip balls and access the collective unconscious to give us better placed ads

@themystery probably not, outside of very special purpose architectures, of which I doubt any of them could have a characteristic of O(1/n)

@themystery remember that all O notation has included a static constant, so something like O(1/n) is not necessarily nonsensical

@themystery there are O(n^3) algorithms which are FASTER than O(n^2) for some n under 1.000.000

Sign in to participate in the conversation
Mastodon for Tech Folks

This Mastodon instance is for people interested in technology. Discussions aren't limited to technology, because tech folks shouldn't be limited to technology either!