FastList.Sort C# (CSharp) Method

    public void Sort (CompareFunc comparer) {
        int start = 0;
        int end = size - 1;
        bool changed = true;

        while (changed) {
            changed = false;

            for (int i = start; i < end; i++) {

                if (comparer(array[i], array[i + 1]) > 0) {
                    T temp = array[i];
                    array[i] = array[i+1];
                    array[i+1] = temp;
                    changed = true;
                }
                else if (!changed) {
                    start = (i==0) ? 0 : i-1;
                }
            }
        }
    }

        internal void Update(SortedBufferedDeletes @in)
        {
            numTerms  += @in.numTerms;
            bytesUsed += @in.bytesUsed;

            terms.AddRange(@in.terms);
            terms.Sort(ref sorter);

            foreach (var term in @in.queries)
            {
                queries[term.Key] = term.Value;
            }

            docIDs.AddRange(@in.docIDs);
            @in.Clear();
        }