Algorithm 2. Peseudo code for the proposed SHO algorithm in data classification.

Start Initialize the parametrs and locations of SHO by Eq. (9)    For      Each individual      Compute survival by Eq. (10)    End for    While $K<K_{max}$      For every prey movement       If prey’s leader         Update the location of prey leader by Eq. (11)        Else         Update prey location by Eq. (14)       End if      End for       For        Every predator’s movement         For each prey           Determine predation probabitity Eq. (15)         End for        Update predator location by Eq. (16)       End for         Re-compute survival value using Eq. (10)         Compute dangerous radius by Eq. (17)         Predation performance by Eqs. (18) and (19)         Restoration performance by Eq. (20)      $K=K+1$    End while    Global optimal output    Fitness for global optimal output End