You are using an out of date browser. It may not display this or other websites correctly. You should upgrade or use an alternative browser.
pancake swap
Pancake sorting is the mathematical problem of sorting a disordered stack of pancakes in order of size when a spatula can be inserted at any point in the stack and used to flip all pancakes above it. A pancake number is the minimum number of flips required for a given number of pancakes. In this form, the problem was first discussed by American geometer Jacob E. Goodman. A variant of the problem is concerned with burnt pancakes, where each pancake has a burnt side and all pancakes must, in addition, end up with the burnt side on bottom.
All sorting methods require pairs of elements to be compared. For the traditional sorting problem, the usual problem studied is to minimize the number of comparisons required to sort a list. The number of actual operations, such as swapping two elements, is then irrelevant. For pancake sorting problems, in contrast, the aim is to minimize the number of operations, where the only allowed operations are reversals of the elements of some prefix of the sequence. Now, the number of comparisons is irrelevant.
Eto guys bagong release ni pancake swap.
Click here
How to register?
Need mo ng binance or metamask
Click mo lang yung connect wallet then kung may naka install na binance sa cp mo. Mag aauto open na yun. Then connect mo lang and then makakapag login kna.
Parang coin master lang pero ang...