Menu
My Site LogoUMich Programming TeamTraining
GitHub
🌜
🌞
My Site LogoUMich Programming Team
  • Training
  • GitHub
  • Section 0: Introduction
    • 0.1 About ICPC
    • 0.2 ICPC Contests
    • 0.3 An Example Problem
    • 0.4 Training Sections
  • Section 1: Sorting and Searching
    • 1.1 STL Containers
    • 1.2 STL Sort
    • 1.3 Binary Search
  • Section 2: Divide and Conquer
    • Document Number 2
  • Section 3: Recursion and Searching Algorithms
    • This is Document Number 3

Binary Search using std::lower_bound()

What is binary search?

Edit this page
Previous
« Solving Problems with std::sort()
Next
Document Number 2 »

Docs

  • Style Guide
  • Second Doc

Community

  • Stack Overflow
  • Discord
  • Twitter

More

  • Blog
  • GitHub
Copyright © 2020 UMich Programming Team. Built with Docusaurus.