In this video, we will learn to code different #searching techniques in CPP along with their time complexity and use cases depending on the type of data structure.
Github link :
https://github.com/hasinaxp/random_pr...
---------------------------------------------------
time-stamps:
00:00 - Introduction
00:52 - Linear Search
05:49 - Binary Search
19:10 - Depth First Search
29:16 - Breadth First Search
36:21 - Searching in Binary Search Trees (BST)
And if you really want to have a time complexity of O(1) just use a hashtable to store your data. In c++ you can use std::unordered_map data structure to do that.
-------------------------------------------------------
Hope this #programming #tutorial helps. please consider subscribing of giving a thumb up for more of such content.