Was Crocodile stronger at Marineford? Or was he holding back in Alabasta?

 During the Alabasta arc, Crocodile displayed a level of power that was initially considered overwhelming by the Straw Hat Pirates. He possessed the Logia-type Devil Fruit called the Suna Suna no Mi (Sand-Sand Fruit), which granted him the ability to control and transform into sand. He had a reputation as a Shichibukai and controlled the desert kingdom of Alabasta from the shadows. His strength was showcased through his battles with Luffy and others. At Marineford, Crocodile was present as part of the war that took place at Marine Headquarters. While he did participate in the battle, he didn't display the same level of dominance as some other powerful characters present. This has led fans to speculate that he might not have been as strong as initially portrayed in Alabasta. It's important to note that power scaling and character abilities can be subject to interpretation and development by the author. Oda often keeps details deliberately open-ended to keep the story intriguing.

What was the first algorithm run on a Quantum Computer?

 The first algorithm run on a quantum computer was called the Deutsch-Jozsa algorithm, and it was developed by David Deutsch and Richard Jozsa in 1992. This algorithm is a simple example of how a quantum computer can be used to solve a problem that is difficult or impossible for a classical computer to solve.

The Deutsch-Jozsa algorithm is a simple example of a quantum algorithm that can be used to determine whether a function is balanced or constant. A function is balanced if it outputs a 1 for half of its inputs and a 0 for the other half. A function is constant if it always outputs the same value, either a 1 or a 0, for all of its inputs.

The Deutsch-Jozsa algorithm uses the principles of quantum mechanics to solve this problem much more efficiently than a classical computer. In particular, it uses the principle of superposition to create a quantum superposition of all possible inputs to the function, which allows it to evaluate the function simultaneously for all of these inputs. This allows the quantum computer to determine whether the function is balanced or constant in a single step, whereas a classical computer would need to evaluate the function for each input separately, which would require many more steps.

The Deutsch-Jozsa algorithm was first run on a quantum computer in 1998, by a team of researchers at the University of Oxford. This marked a significant milestone in the development of quantum computing and demonstrated the potential of quantum computers to solve certain problems much more efficiently than classical computers.