algorithm-binary_search
2011-03-15 19:17
609 查看
#include <stdio.h>
#include <algorithm>
using namespace std;
int main()
{
int a[5];
for(int i=0;i<5;i++)
{
scanf("%d",&a[i]);
}
sort(a,a+5);
if(binary_search(a,a+5,3))
printf("YES/n");
else
printf("NO/n");
return 0;
}
#include <algorithm>
using namespace std;
int main()
{
int a[5];
for(int i=0;i<5;i++)
{
scanf("%d",&a[i]);
}
sort(a,a+5);
if(binary_search(a,a+5,3))
printf("YES/n");
else
printf("NO/n");
return 0;
}
相关文章推荐
- optimal_binary_search_tree introduction to algorithm 3rd, example 15.5
- LeeCode Search in a Big Sorted Array java solution use binary search algorithm
- Binary search algorithm in C source code
- Algorithm - Binary Search on 2D Array
- Binary Search and Euclid Algorithm
- BinarySearchAlgorithm
- algorithm 1.4.22 Binary search with only addition and subtraction
- binary search algorithm
- [Algorithms] Binary Search Algorithm using TypeScript
- Binary Search Algorithm
- 减治法——二分查找算法(Decrease and Conquer by a Factor - Binary Search Algorithm)
- leetcode find-minimum-in-rotated-sorted-array java solution use binary search algorithm
- 【DataStructure&AlgorithmInJava】Ch02-BinarySearchDemo
- binary search algorithm
- 【DataStructure&AlgorithmInJava】Ch02-OrderArray w binarySearch
- Unique Binary Search Trees II [leetcode]
- 98. Validate Binary Search Tree
- leetcode-Validate Binary Search Tree
- PAT1099:Build A Binary Search Tree
- Algorithm: Binary Tree(2) -- Special Trees (BST and Balanced Tree)