I am please to inform you, math-fun, that I have developed the next generation sorting algorithm. I call it QUOBOSORT. Let me describe it. Randomly permute a list X until the minimum is in the first position of X. When this occurs, QUOBOSORT the rest of X until we reach an empty list. Here is the more formal algorithm. ALGORITHM --------- QUOBOSORT(X) := -- INPUT: a list of integers X -- OUTPUT: sorted X Q0. Is X an empty list? Yes: Return X. No : Go to Q1. Q1. Find the minimum M of X. Q2. Randomly permute X. Q3. Is M in the first position of X? Yes: Concatenate M and QUOBOSORT(REST(X)) No : Go to Q2. After one sorting iteration, the algorithm speeds up about N times! I hope you all are impressed. Sincerely, Robert Smith Inventor of QUOBOSORT