A c++ question: search.h: Compromise Search is a compromise between Binary Search and Linear Search: We use Binary Search until we get to small_size elements, then we switch to Linear Search. Binary Search between low and high until the gap between low and high is <= small_size, then use std::find on the range (from low to high). For example, vector words = {"aaa", "bbb", "ccc", "ddd", "eee"}; cout << *compromise_search(words.begin(), words.end(), "bbb", 3) << endl; will print "bbb\n". compromise_search will - calculate the middle - see that "bbb" < "ccc" (and update the upper bound) - see that the remaining range (from "aaa" to "ccc" exclusive) has <= small_size (3) elements - use std::find to search through the remaining range (from "aaa" to "ccc" exclusive) RandomAccessIt is a random-access iterator, like vector::begin(). low is inclusive and high is exclusive. template RandomAccessIt compromise_search( RandomAccessIt low, RandomAccessIt high, const T& value, int small_size) { //code }
A c++ question: search.h: Compromise Search is a compromise between Binary Search and Linear Search: We use Binary Search until we get to small_size elements, then we switch to Linear Search. Binary Search between low and high until the gap between low and high is <= small_size, then use std::find on the range (from low to high). For example,
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
