binary_search {
61uint64_t binarySearch(std::vector<uint64_t> arr, uint64_t val) {
63uint64_t high = arr.size() - 1;
66uint64_t m = low + (high - low) / 2;
75 else if(val < arr[m]) {
97std::vector<uint64_t> arr = {{1, 3, 5, 7, 9, 8, 6, 4, 2}};
98std::sort(arr.begin(), arr.end());
99uint64_t expected_ans = 3;
100uint64_t derived_ans = search::binary_search::binarySearch(arr, 4);
101std::cout <<
"Test #1: ";
102assert(derived_ans == expected_ans);
103std::cout <<
"Passed!"<< std::endl;
114std::vector<uint64_t> arr = {{1, 23, 25, 4, 2}};
115std::sort(arr.begin(), arr.end());
116uint64_t expected_ans = 4;
117uint64_t derived_ans = search::binary_search::binarySearch(arr, 25);
118std::cout <<
"Test #2: ";
119assert(derived_ans == expected_ans);
120std::cout <<
"Passed!"<< std::endl;
131std::vector<uint64_t> arr = {{1, 31, 231, 12, 2, 5, 51, 21, 23, 12, 3}};
132std::sort(arr.begin(), arr.end());
133uint64_t expected_ans = 8;
134uint64_t derived_ans = search::binary_search::binarySearch(arr, 31);
135std::cout <<
"Test #3: ";
136assert(derived_ans == expected_ans);
137std::cout <<
"Passed!"<< std::endl;
static void test2()
Self-implementations, 2nd test.
static void test1()
Self-test implementations, 1st test.
int main()
Main function.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4