question archive Implement the Binary Search algorithm in your compiler and then use it to compare searching times with the find function of the STL
Implement the Binary Search algorithm in your compiler and then use it to compare searching times with the find function of the STL
Subject:Computer SciencePrice: Bought3
Implement the Binary Search algorithm in your compiler and then use it to compare searching times with the
find function of the STL. To perform the test, create an array or vector of at least 100,000 elements. Which
algorithm is faster and by how much? Put your analysis in comments at the end of your program.
