Easy language to repeated high-speed, Yi Jing Wei Liang "Eat tail" algorithm

Algorithm million data to an array of easy language to repeat, Yi Jing Wei Liang Forum tail eating "0.2 seconds

 This command has to find a lot of ideas are big machine data for trouble.
With this would be much better
This array is to remove duplicated commands 2
=======================================
Version 2
 
The count header cycles (whichever number array (Array 2) members, i)
 
    If true (access member array (Array 2) <i)
        Out of the loop ()
    If true end
    Variable first cycle (access member array (Array 2),  I +. 1 , -1, I2)
 
        If true (the array 2 [i] = array 2 [i2])
            Delete Member (array 2, i2,)
        If true end
 
    Variable Tail loop ()
 The count cycles tail ()
=============================================================
 The idea is to command, count cycles, each pick out a matching array members in addition to compare their own.
A first external counting cycle, the order pick a single array member
Cycle internal variable key (i + 1) excluded itself, matching, the matching is successful deleted.
 After the encounter like the direct use, you did not need to get to the bottom
 
======================
 Coupled with a super list box to repeat the command
Very useful
 
This command is to delete all entries, and then went to repeat array into them.
Why not choose to delete all but deleted a single cycle, with who knows who, so that card ~ ~ ~ ~ cycle is better
This will be the command to learn that regular can easily create capture software.
 

Guess you like

Origin www.cnblogs.com/hongyuyingxiao/p/12114214.html