linear search | DSA basic | Student technique
Searching and sorting is integral part of DSA. Linear search algorithm is the simplest searching technique. In Linear search elements are searched by one by one from index 0 to last index. linear search time complexity is O(n) and space complexity is O(1).
Hope you will enjoy watching it. Please like comment and subscribe to channel. Thanks! -- student technique.
___________________________________________________________________________________
github link: https://github.com/MohitVermaCoder
Stream API playlist: • java 8 stream practice problem | java 8 st...
java interview preparation playlist: • tricky java interview questions and answer...
Jenkins playlist: • jenkins installation step by step | how to...
HackerRank Angular basic problem solution: • hackerrank | hacker rank weather detail so...
---------------------subscribe here-------------------------------
/ @studenttechnique
**video content:
0:00 - Linear search intro
2:45 - Linear search time complexity scenario
6:45 - linear search code
9:17 - dry run of linear search
#linearsearch #dsa #studenttechnique #linearsearchalgorithm #linearsearchvsbinarysearch
#coding #leetcode #faang #learning #dsabasic
Thanks for watching this video. If you have liked this video then please give a like and also press the subscribe button and hit the bell icon.