The invention discloses an adaptive binary electronic tag collision processing algorithm. The algorithm comprises the steps of S1, initializing a query stack; S2, reading query codes in the query stack, and sending a query instruction; S3, receiving a response signal of an electronic tag, analyzing the response signal, skipping to the step S4 when a collision occurs, skipping to the step S5 when the response signal is not null and the collision does not occur, and skipping to the step S6 when the response signal is null; S4, calculating a collision factor, and when the collision factor is greater than or equal to a preset collision factor threshold value, generating H new query codes and writing the H new query codes in the query stack, otherwise, generating K new query codes and writing the K new query codes in the query stack; skipping to the step S2; S5, skipping to the step S6 when the query according to the query instruction succeeds; and S6, judging whether the query stack is null or not, and if yes, ending the process, otherwise, skipping to the step S2. The algorithm has the advantages of high identification rate, high identification speed and the like.