Algoexpert.io

DAY 1

Binary Search: low and high are indices and not elements in the array. to make the code easy and clean set these in the beginning and remember the mid calculation formula. you also dont need a for loop because the comparison is between mid and target value so need for arr[i]. But a while loop which run until low<= high which will also chop the lenght of the loop by half which is why the complexity is logn

Name		Name	Last commit message	Last commit date
Latest commit History 17 Commits
README.md		README.md
binary.search.cpp		binary.search.cpp
class.photo.cpp		class.photo.cpp
find.three.largest.number.cpp		find.three.largest.number.cpp
minimum.waiting.time.cpp		minimum.waiting.time.cpp
search.in.a.sorted.matrix.cpp		search.in.a.sorted.matrix.cpp
tandem.bicycle.cpp		tandem.bicycle.cpp