Binary Search with C++ STL | 4 Problems followed up | Lower Bound and Upper Bound explained

Показать описание

In case you are thinking to buy courses, please check below:

---------------------------------------------------------------------------------------------------------------------------------------------------- Binary Search is one of the most widely used algorithms in programming. Its good to know some shortcuts which saves a lot of time in Contests. However, in interviews it is highly advised to code Binary Search.

At 0:50 I said a+n points to the last element, it will be it points to after the last element, also the function takes range [Start, end). which means takes the starting element, and excludes the last element.

Please subscribe to the channel if you have not done it. Do leave a like and a comment, as YouTube recommends videos with more likes and comments.

Join out telegram channel to interact directly with me. Thanks!

Рекомендации по теме

Комментарии

the end pointer points to the element after the last element, like a.end() will point to the element after the last element.. also a + n will point to the nth element (which doesn't actually exist, it's a theoretical end position).. the pointers point like [start, end)..

utsavsingh

Whether you are doing an interview or working on your project, always stick to the STL. The algorithms in STL are written in the most optimized way. They can outperform the same algorithms written in C. That’s the promise of STL: either it runs faster than C code or at least not slower than C.

Sobioytccc

The way you simplified the explanantion is amazing!

Nishi-Tiwari

what a coincidence sir I was learning this STL a few minutes ago and you make a video on this thanks a lot sir!!

deepakkoushal

Yesterday I was getting TLE on a problem because I was doing linear search, and decided to learn binary search and here it is !

ShivamSingh-vuvq

9:20 in this we could write index instead of -1 in the else statement in cout

agx

Undoubtedly the best video tutorial on the topic ❤️❤️❤️ Good job @Striver

evergreen

Awesome explanation bro...
Please try to make more videos on STL..

Thank you

nagavijaykumarprathi

How someone can explain with this ease....thanks bhaiya

lyricalfade

Wonderful demonstration of stl binary search

rohitsai

No kidding, You really explain very well . Thank you for all these videos . Really very helpful!!!!

HarshitSingh-itkp

I was confusing lower bound with floor value. thank you so much!

Mrswapsam

thank you srila prabhupad, krishna and sir

freeandreliablejeeprep

the upper bound condition check should be like this. you missed the -1 from index.
if( ind >= 0 && [ ind - 1 ] ==x)cout<<j<<endl;

fahimtoufiqulislam

Thank you very much. You are a genius. 👍👍👌👌🙏🙏🔝🔝

vakhariyajay

Amazing the problem set as well as explanation

chinturadix

Please upload more dynamic programming videos

Firstusee

Should the array be previously sorted to perform lower and upper bound

ShivamSingh-vuvq

thank u so much for this wonderful video

smoothierudiee

You literally speak like the girl in the American Pie who kept saying:
"Aah, .... that one time, ..at Band Camp"😂😅.

But you really are a solid teacher.. loved the video.

shishankrawat

Binary Search with C++ STL | 4 Problems followed up | Lower Bound and Upper Bound explained

Binary Search with C++ STL | 4 Problems followed up | Lower Bound and Upper Bound explained

Implement binary search in one line by using Binary Search STL function in C++ | C++ STL tutorial -5

BINARY SEARCH STL

STL Algorithms 2: std::binary_search, std::lower_bound & std::upper_bound

STL Algorithm | Binary Search

4. STL Functions for Binary Search | Detailed explanation with examples & solution-Lower,Upper B...

Binary Search in C++ Standard Template Library (STL) | Binary Search in C++ STL | std::binary_search

Binary Search Using STL in C++ Programming || Code Block || Coding Interview Questions

#031 [Data Structures] - Binary Search Algorithm With Implementation

C++ Programming Language Tutorial | Searching & Sorting in an Array using STL | GeeksforGeeks

Binary search in C++ | C++ | Sorting algorithms | STLfunctions 🔥

Binary search in STL with Code | Data Structure and Algorithm For Beginners in Hindi | Hello World

Binary Search STL_CodeForces

Lesson 10: Introduction to Algorithms by Mohammad Hajiaghayi: C++ STL, Binary Search & Applicati...

BS-2. Implement Lower Bound and Upper Bound | Search Insert Position | Floor and Ceil

STL Series #2 | Sort function, Binary Search, Iterators and vectors

C++ STL -- Binary Search (std::binary_search, std::lower_bound, std::upper_bound)

Binary Search Using C++ STL | Standard Template Library | First Occurrence & Last Occurrence Pro...

Upper Bound and Lower Bound in C++ STL | CP Course | EP 35

2.0 Lower Bound and Upper Bound in C++ STL | Binary Search | @codingsamurais

Binary Search - Iterative Implementation and common errors

CppCon 2018: Jonathan Boccara “105 STL Algorithms in Less Than an Hour”

C++ binary search

Binary Search from scratch | Master binary search | Siddhartha | GeeksForGeeks C/C++