Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
bin search
Language:
Ada
Assembly
Bash
C#
C++ (gcc)
C++ (clang)
C++ (vc++)
C (gcc)
C (clang)
C (vc)
Client Side
Clojure
Common Lisp
D
Elixir
Erlang
F#
Fortran
Go
Haskell
Java
Javascript
Kotlin
Lua
MySql
Node.js
Ocaml
Octave
Objective-C
Oracle
Pascal
Perl
Php
PostgreSQL
Prolog
Python
Python 3
R
Rust
Ruby
Scala
Scheme
Sql Server
Swift
Tcl
Visual Basic
Layout:
Vertical
Horizontal
//Title of this code //g++ 4.8.2 #include <iostream> #include <vector> int find(std::vector<int>& t, int n) { int begin = 0; int end = t.size() - 1; while (begin <= end) { int mid = (end - begin) / 2 + begin; if (t[mid] == n) { return mid; } else if (t[mid] < n) { begin = mid + 1; } else { end = mid - 1; } } return -1; } int main() { std::vector<int> t = {2,4,6,8,10,11,14,18,23,32}; int i = find(t, 11); std::cout << "t[" << i << "] = " << t[i] << std::endl; }
g++
Show compiler warnings
[
+
] Compiler args
[
+
]
Show input
Compilation time: 0.45 sec, absolute running time: 0.14 sec, cpu time: 0 sec, memory peak: 3 Mb, absolute service time: 0.6 sec
fork mode
|
history
|
discussion
t[5] = 11