GM算法 -- 在n个已排序（非减）的列中寻找所有元素中第i小的元素

Procedure: GM

Input: For each j ∈ {1 .. J}, a column {a_i,j | i = TOP_j .. BOT_j} of nondecreasing elements, where TOP_j <= BOT_j are indexes of the column ranges under consideration. A number I between 1 and the total number of elements ∑_j=1^J(BOT_j - TOP_j + 1) in the columns.

Output: An Ith smallest element η, and, for each j ∈ {1..J}, a partition of each range {TOP_j .. BOT_j} into three new ranges, {TOP_j¹ .. BOT_j¹}  with value less than η, {TOP_j² .. BOT_j²} with value equal to η, {TOP_j³ .. BOT_j³} with value greater than η.

    Set T_j = TOP_j and Bj = BOT_j for each j ∈ {1 .. J}.

    Do forever

        Set M_j = B_j - T_j + 1 for each j ∈ {1 .. J}. Set S = ∑_j=1^JM_j.

        For each j ∈ {1 .. J}, find the median element η_j of the set {a_i,j | i = T_j .. B_j}. Sort the medians in nondecreasing order,  so that η_j1 <= η_j2 <= .. <= η_jJ.

        Compute the value k such that ∑_j=1^k-1M_j < S/2 <= ∑_j=1^kM_j. Set η = η_k.

        Compute for each j ∈ {1 .. J}, TT_j = min{i | (TOP_j <= i <= BOT_j) ∧ (a_i,j = η)}, and BB_j = max{i | (TOP_j <= i <= BOT_j) ∧ (a_i,j = η)}.

        Set M_{¹ =} ∑_j=1^J(TT_j - T_j) and M² = ∑_j=1^J(BB_j - T_j + 1).

        If (M¹ < I <= M²) then begin

            η is an Ith smallest element. Set TOP_j¹ = TOP_j, BOT_j¹ = TT_j - 1, TOP_j²  = TT_j, BOT_j² = BB_j, TOP_j³ = BB_j + 1, BOT_j³ = BOT_j.

            Halt.

        End

        If (M^₁ >= I) then set B_j = TT_j.

        If (M² < I) then set T_j = BB_j + 1 and decrement I by M².

    End do

End GM