In this session, we begin by discussing the C++ Standard Template Library (STL) and the various data structures it implements. Then, we cover sequences and sets, including a comprehensive analysis of binary search. We examine a range of applications for binary search, including searching in a cyclic sequence, searching for a specific fixed index, searching in sequences of unknown size, and interpolation search.
#algorithms, #design, #induction, #recursive, #C++, #STL, #set, #sequence, #binarysearch, #analysis , #cyclicsequence, #searchifixedindex, #unknownsize, #interpolationsearch, #comparision, #geeksforgeeks , #hackerrank, #leetcode, #cs, #computerscience
All handwritten and typed notes for this course are available through the website of the instructor
at http://www.cs.umd.edu/~hajiagha/ (Just click on the "Introduction to Algorithms" course from the website).