In general, let G be a finite cyclic group with n elements.
Suppose an algorithm is being developed to operate on a set of n elements.
Let X be a finite set with n elements.
Then, the space used for n elements varies between and .
For example, this will be the case after accessing all n elements in non-decreasing order.
Array of n elements can be sorted within n-1 passes.
Therefore q has a field of definition generated by n elements.
Let us say we have an array of n elements.
If the set A has n elements, then will have elements.
There are ways to choose k elements from a set of n elements.