I'm currently studying the cube-solving algorithms developed by Kociemba, Korf, and Thistlethwaite and I'm interested in understanding their computational complexities.
Could someone please explain or provide the Big O notation for the time complexity of these algorithms?
Any insights or resources on this topic would be greatly appreciated.