Ubiquitous Binary Search - Basic Algorithms Fast (20)

Published: 03 March 2023
on channel: Begin Coding Fast

1,192

Let's take a look at the ubiquitous binary search algorithm, which uses only one if-statement in each of the iterations. In an iteration, an array is divided into two halves of approximately equal length. The half that is likely to contain the target is retained. The iteration stops when the high index and low index are consecutive. When the high or low index element equals the target, the target is found. Else, the target is not found.

1:48 - Difference between ubiquitous binary search and conventional binary search
2:32 - Case when the target is found
7:35 - 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...

#ubiquitousbinarysearch #algorithm #begincodingfast #algorithmvisualization

On this page of the site you can watch the video online Ubiquitous Binary Search - Basic Algorithms Fast (20) with a duration of hours minute second in good quality, which was uploaded by the user Begin Coding Fast 03 March 2023, share the link with friends and acquaintances, this video has already been watched 1,192 times on youtube and it was liked by 12 viewers. Enjoy your viewing!

283,391

945