Binary search / C++, Arduino, ESP32, ESP8266, STM, AVR

#search #iot #C #esp32 #sorts #bigo #shots #binarysearch Binary search, example: in C plus plus. Binary search is a more efficient search algorithm that works on sorted lists. The basic idea behind binary search is to repeatedly divide the search interval in half. The algorithm begins by comparing the middle element of the list to the element you are searching for. If the middle element is equal to the element, the algorithm returns the index of that element. If the middle element is less than the element, the algorithm continues the search in the right half of the list. If the middle element is greater than the element, the algorithm continues the search in the left half of the list. This process is repeated until the element is found or the list is exhausted. More information in the full video on the channel. 🤍youtu.be/yBtWcLauwnU