Skip to main content
. 2020 Apr 29;20(9):2513. doi: 10.3390/s20092513
Algorithm 10 sortClusters.
   Input: Z^,c^is,k^      Output: Z^,c^is
  • 1:

    score=0,index=0,row,flag=1

  • 2:

    forh1 to |P^is| do

  • 3:

      flag=0

  • 4:

      for g2;g<|P^is|flag;gg+1 do

  • 5:

        if k^g<k^g1 then

  • 6:

          index=o^g1s //swap elements

  • 7:

          o^g1s=o^gs

  • 8:

          o^gs=index

  • 9:

          row=Z^(g1,) //swap elements

  • 10:

          Z^(g1,)=Z^(g,)

  • 11:

          Z^(g,)=row

  • 12:

          flag=1 // indicates that a swap occurred.

  • 13:

        end if

  • 14:

      end for

  • 15:

    end for