If it depends on large amounts of computation, how can it be considered more efficient? If it's precomputed, then it's again pattern matching. If by algorithm you mean the sequence of rotations, then yes there is a small upper bound that speedcubers typically exceed in solving any specific randomization. [I never liked that some call a fixed sequence of moves an algorithm.]

Rubik's Cube solution unlocked by memorising 3915 final move sequences[0].

> For the first time, a speedcuber has demonstrated a solution to the Rubik’s cube that combines the two final steps of the puzzle’s solution into one

[0] https://www.newscientist.com/article/2334632-rubiks-cube-sol...