2 ms·
In lay terms, an example of a galactic algorithm is one which has better big O complexity than algorithms currently in use, but where the crossover point of bet
by BeetleB 7y ago
In lay terms, an example of a galactic algorithm is one which has better big O complexity than algorithms currently in use, but where the crossover point of better performance than the status quo requires an incredibly large N - so large that we can't conceive any practical problem where this algorithm will perform better.
For example, you may need an N larger than the number of stars in the universe. Hence the term "galactic". I've seen another one that requires an N larger than the number of atoms in the universe.