Introduction - If you have any usage issues, please Google them yourself
Two search and binary search, the utility model has the advantages of low frequency, average speed, good performance, the system memory is less; the disadvantage is the requirement for 0.9 ordered list, and insert delete difficult. Therefore, the binary search method for an ordered list to find frequent and often change. First of all, the periodic table is assumed in ascending order, compared with the keyword search keywords will form the middle position of the record, if the two are equal, find success; otherwise the middle position recorded before and after the table is divided into two sub tables, if the middle position recorded in a keyword search keywords, before further lookup sub table otherwise, after a further search of the child table. Repeat the above process until the lookup is successful, or until the subtable does not exist, and the lookup is not successful.