Exponential Search - Basic Algorithms Fast (19)
Give that there is a sorted array. By using exponential search, we determine the exponent of 2, such that the starting and ending indices of a window are related to the power of 2. Once the window is determined, we perform binary search on that portion and see if the target can be found.
0:55 - Finding out the exponent of 2
2:03 - Case when the target is found
7:51 - Case when the target is not found
Playlist of my Algorithm walkthrough
• Algorithms and data structures | DSA ...
Basic Python Fast
• Python tutorial for beginners | Pytho...
Playlist of my Python examples
• Python projects for beginners with fu...
Playlist of my Java course
• [14 hours] Java tutorial for beginner...
Playlist of my Java examples
• Java projects for beginners | Java pr...
#exponentialsearch #algorithm #begincodingfast #algorithmvisualization