theepag / Hacktoberfest-2021

Hacktoberfest repository
1 stars 20 forks source link

Binary Search with Time Complexity - O(log n) #45

Open AnuragKumar007 opened 1 year ago

AnuragKumar007 commented 1 year ago

Binary Search is Optimised Algorithm for Searching. It's time-complexity in worst case is O(log n) while in Best case O(1).