fork download
copy 
  1. #include <iostream>
  2.  
  3. using namespace std;
  4.  
  5. int binarySearch(int x[], int l, int r, int key) {
  6. 	if (r < l) return -1;
  7. 	else {
  8. 		int m = (l + r) / 2;
  9. 		if (x[m] == key) 
  10. 			return m;
  11. 		else if (x[m] > key) 
  12. 			return binarySearch(x, l, m - 1, key);
  13. 		else 
  14. 			return binarySearch(x, m + 1, r, key);
  15. 	}
  16. }
  17.  
  18. int main(int argc, char const *argv[])
  19. {
  20. 	int A[9] = {4, 14, 24, 34, 54, 64, 74, 84, 94};
  21. 	int n = 9, k1 = 64, k2 = 45;
  22. 	int vt1 = binarySearch(A,0,n,k1);
  23. 	if (vt1 != -1)
  24. 		cout<<"Tim thay so "<<k1<<" o vi tri "<<vt1+1<<" trong day"<<endl;
  25. 	else
  26. 		cout<<"Khong tim thay so "<<k1<<" trong day"<<endl;
  27. 	int vt2 = binarySearch(A,0,n,k2);
  28. 	if (vt2 != -1)
  29. 		cout<<"Tim thay so "<<k2<<" o vi tri "<<vt2+1<<" trong day"<<endl;
  30. 	else
  31. 		cout<<"Khong tim thay so "<<k2<<" trong day"<<endl;
  32. 	return 0;
  33. }
  34.  
Success #stdin #stdout 0.01s 5272KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Tim thay so 64 o vi tri 6 trong day
Khong tim thay so 45 trong day
https://ideone.com/SS9X1D
language:
C++ (gcc 8.3)
created:
9 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!