filmov
tv
Lec-14: Linear Search in Data Structure by #Naina Mam | Time Complexity
Показать описание
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. In this video you will get full explanation with best examples given by Naina Mam and How to analyze time complexity in all the cases(Best Average and Worst).
0:00 - Introduction
0:33 - Linear search
1:55 - Working
4:01 - Algorithm
10:27 - Time complexity
►Data Structure (Complete Playlist):
Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Computer Architecture (Complete Playlist):
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Design and Analysis of algorithms (DAA) (Complete Playlist):
►Graph Theory:
►Programming in C:
►Digital Logic:
---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Комментарии