glossary.tex

% !TEX root = algo-quicksheet.tex
%%%%%%%%%%%%%%%%%%%%%%acronym.tex%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% sample list of acronyms
%
% Use this file as a template for your own input.
%
%%%%%%%%%%%%%%%%%%%%%%%% Springer %%%%%%%%%%%%%%%%%%%%%%%%%%

\Extrachap{Glossary}

\runinhead{in-place} The algorithm takes $\leq c \lg N$ extra space
\runinhead{partially sorted} Number of inversion in the array $\leq cN$
\runinhead{non-degeneracy} Distinct properties without total overlapping
\runinhead{underflow} Degenerated, empty, or null case
\runinhead{loitering} Holding a reference to an object when it is no longer needed thus hindering garbage collection. 
\runinhead{subsarray} Continuous subarray $A[i:j]$
\runinhead{subsequence} Non-continuous ordered subsequence that $S\subset A[i:j]$.
\runinhead{invariant} An invariant is a condition that can be relied upon to be true during execution of a program. A loop invariant is a condition that is true at the beginning and end of every execution of a loop.