二分探索
#!/usr/bin/env ruby def bserach(data, search) data.sort! min = 0 max = data.size - 1 while min <= max mid = (max + min) / 2 if data[mid] < search min = mid + 1 elsif data[mid] > search max = mid - 1 else puts "find #{search}" return end end puts "not find #{search}" end data = [333, 34, 108, 40, 900, 3, 32, 311111111] bserach(data, 900)