Basics of Asymptotic Analysis (Part 1)
Neso Academy
A data structure is the organization of the data in a way so that it
can be used efficiently. We want to use our data efficiently. And we
want to perform some operations on it. For this purpose, we are
using the data structure which is efficient in terms of storing the
data. An ideal data structure could be the one that takes the least
possible time for all its operations and consumes the least memory
space. An array is capable of storing 100 elements in a data
structure. The size of the array is not defined. But just think of this
that , this array is able to store 100 elements. And right now, we
have eight elements in this array. We will shift these elements
towards right so that there should be an empty slot over here. Then,
we can easily add our element at the beginning of the list. Inserting
an element at the beginning of the list is way faster in the linked list
than arrays. Inserting a data structure is much efficient in adding
data in comparison to the array. In this way, we can compare data
structures and this will ultimately give the idea to select the best
possible data structure for a particular operation.
Study time complexity is very important. This will help us in
determining which data structure is better for a particular operation.
Okay friends, this is it for now. Thank you for watching this
presentation. Back to the page you came from the bottom of the
page. Share your knowledge of the presentation.
, Basics of Asymptotic Analysis (Part 2)
Neso Academy
WE have learnt that on the basis of operations performed on data
structures, we could be able to compare the time complexity of the
data structures.. But how to find time complexity or running time of
an operation performed on a data structure.? Let 's tackle this
question by using some methods. Examine the exact running time
for different inputs on one data structure. Exact running time
calculation is not at all practical--let me tell you it is not practical. IT
might also be possible that in some machine for some input size of
data structure, it is performing well while in the other machine,, the
second. structure is giving the best performance on the other input
size..
Basics of Asymptotic Analysis (Part 3)
Neso Academy
A data structure is the organization of the data in a way so that it
can be used efficiently. We want to use our data efficiently. And we
want to perform some operations on it. For this purpose, we are
using the data structure which is efficient in terms of storing the
data. An ideal data structure could be the one that takes the least
possible time for all its operations and consumes the least memory
space. An array is capable of storing 100 elements in a data
structure. The size of the array is not defined. But just think of this
that , this array is able to store 100 elements. And right now, we
have eight elements in this array. We will shift these elements
towards right so that there should be an empty slot over here. Then,
we can easily add our element at the beginning of the list. Inserting
an element at the beginning of the list is way faster in the linked list
than arrays. Inserting a data structure is much efficient in adding
data in comparison to the array. In this way, we can compare data
structures and this will ultimately give the idea to select the best
possible data structure for a particular operation.
Study time complexity is very important. This will help us in
determining which data structure is better for a particular operation.
Okay friends, this is it for now. Thank you for watching this
presentation. Back to the page you came from the bottom of the
page. Share your knowledge of the presentation.
, Basics of Asymptotic Analysis (Part 2)
Neso Academy
WE have learnt that on the basis of operations performed on data
structures, we could be able to compare the time complexity of the
data structures.. But how to find time complexity or running time of
an operation performed on a data structure.? Let 's tackle this
question by using some methods. Examine the exact running time
for different inputs on one data structure. Exact running time
calculation is not at all practical--let me tell you it is not practical. IT
might also be possible that in some machine for some input size of
data structure, it is performing well while in the other machine,, the
second. structure is giving the best performance on the other input
size..
Basics of Asymptotic Analysis (Part 3)
