Binary Search in Sorted Containers : qBinaryFind « Qt « C++

1. C++
2. Qt
3. qBinaryFind

Binary Search in Sorted Containers

  


#include <QList>
#include <QDebug>

int main() {
  QList<int> numbers;
  numbers << 1 << 5 << 6 << 7 << 9 << 11;
  QList<int>::iterator it;
  it = qBinaryFind(numbers.begin(), numbers.end(), 6);
  qDebug() << * it; // 6
  numbers.clear();
  numbers << 1 << 6 << 6 << 6 << 9 << 11;
  it = qBinaryFind(numbers.begin(), numbers.end(), 6);

  qDebug() << * it;

  return 0;
}

   
    
  

Related examples in the same category