[Member (365WT)]answers [Chinese ] | Time :2019-04-11 | For example, I have array data, 1000 elements, to find x from inside, linear search, is to find the tail from the beginning, in turn to see if data[0] is equal to x, if not data[1], data[2], and so on Always find the last one. The slowest, but the most versatile.
Sexual quality
search for
Special feature
Linear |
|