 A Ghost Leg can be constructed arbitrarily, but such a Ghost Leg is not necessarily prime.It can be proven that only those Ghost Legs constructed by bubble sort contains the least number of legs, and hence is prime.This is equivalent to saying that bubble sort performs the minimum number of adjacent exchanges to sort a sequence.