Linear Search (বাংলা) || Bangla Tutorial || C++ || Searching Algorithm
In computer science, a linear search or sequential search is a method for finding an element within a list. It sequentially checks each element of the list until a match is found or the whole list has been searched.
Worst-case complexity: O(n)
Average-case complexity: O(n)
Space complexity: O(1)
Worst-case space complexity: O(1) iterative
Average performance: O(n/2)
Thanks for watching :)