1.2 Array Operations - Traversal, Insertion | Explanation
with C Program | DSA Course
I am going to talk about various operations performed on arrays in data structure on 1d arrays
specifically. I have already discussed the fundamentals of arrays what is need of Faerie array
declaration in acidization of array memory representation of air in the previous video so if you
check out that video then I 'll provide you the link in the description box you can check out there.
We are going to write down the code for this. something like this I have already discussed in the
previous video this concept and detail fine. I 'm going to ask from the user what elements the
user wants in the area how to populate the area at runtime. We will just write header files and all
I think you can write that thing. Ask from the user that how many data the user want to insert in
this area what is the actual size of the array this is the maximum size fine. If user will give
something some input that is some integer value then obviously that value should be stored in
memory and how values to be stored using variable so you have to declare one another variable.
We will discuss how data is to be inserted in the air at specific position. If you get how data can
be inserted at a specific position then you can easily modify the code for inserting the data at the
beginning and at the end of theory fine so now we will see how to. We are using one more
variable that is i so you have to declare this variable. There is no upper bound checking concept
of areas in areas in C like this if you take hair in a is equal to 50 fine. Memory man is it has has
allocated to how many bytes two hundred bytes for storing 50 elements. If you enter the size 51
or you can say 60 then user can insert 60 values also but that is not actually correct. We all we
want all the previous element as well as we want some extra element that you want to insert so
you can not do directly this so another approach is what you can shift these elements to the right
side. From variable to start the loop we are going to start from here from the last element of there
you can say from size minus 1.
of bounds checking of arrays in c so programmer has to write down the code itself for the
checking of the boundaries in c. programmer must write down a for loop for the swapping of
arrays. Programmer writes down code that checks the boundaries of an array in c code. Just write
down a for loop in for loop you will start from 0 to the size fine and you simply write printf
percentage D and a of I and these all values would be printed this is how we are going to insert
the data at specific position fine. After inserting this number array size becomes what 6 so now
size becomes size plus plus plus right now finally you will print this area how you can print it.
How you will insert simply you just enter the data you want to insert simply. No need to ask the
position no need to do this swapping and all fine simply will write a off here here means you can
say that size a of size size size is 5 5 so here also you can insert at 6th position that is also fine
but after size plus 1 you can not insert.
In best case it is one and in worst cases it is Theta N and basically time complexity the time
taken depends on the position given. In unsorted array you have to take care of the relative
ordering of the elements in sorted array in that case you are doing two shift operations so you can
apply this shifting operations in this unsorted area. delete data from the array so I 'll see you in
the next video till then bye-bye take
with C Program | DSA Course
I am going to talk about various operations performed on arrays in data structure on 1d arrays
specifically. I have already discussed the fundamentals of arrays what is need of Faerie array
declaration in acidization of array memory representation of air in the previous video so if you
check out that video then I 'll provide you the link in the description box you can check out there.
We are going to write down the code for this. something like this I have already discussed in the
previous video this concept and detail fine. I 'm going to ask from the user what elements the
user wants in the area how to populate the area at runtime. We will just write header files and all
I think you can write that thing. Ask from the user that how many data the user want to insert in
this area what is the actual size of the array this is the maximum size fine. If user will give
something some input that is some integer value then obviously that value should be stored in
memory and how values to be stored using variable so you have to declare one another variable.
We will discuss how data is to be inserted in the air at specific position. If you get how data can
be inserted at a specific position then you can easily modify the code for inserting the data at the
beginning and at the end of theory fine so now we will see how to. We are using one more
variable that is i so you have to declare this variable. There is no upper bound checking concept
of areas in areas in C like this if you take hair in a is equal to 50 fine. Memory man is it has has
allocated to how many bytes two hundred bytes for storing 50 elements. If you enter the size 51
or you can say 60 then user can insert 60 values also but that is not actually correct. We all we
want all the previous element as well as we want some extra element that you want to insert so
you can not do directly this so another approach is what you can shift these elements to the right
side. From variable to start the loop we are going to start from here from the last element of there
you can say from size minus 1.
of bounds checking of arrays in c so programmer has to write down the code itself for the
checking of the boundaries in c. programmer must write down a for loop for the swapping of
arrays. Programmer writes down code that checks the boundaries of an array in c code. Just write
down a for loop in for loop you will start from 0 to the size fine and you simply write printf
percentage D and a of I and these all values would be printed this is how we are going to insert
the data at specific position fine. After inserting this number array size becomes what 6 so now
size becomes size plus plus plus right now finally you will print this area how you can print it.
How you will insert simply you just enter the data you want to insert simply. No need to ask the
position no need to do this swapping and all fine simply will write a off here here means you can
say that size a of size size size is 5 5 so here also you can insert at 6th position that is also fine
but after size plus 1 you can not insert.
In best case it is one and in worst cases it is Theta N and basically time complexity the time
taken depends on the position given. In unsorted array you have to take care of the relative
ordering of the elements in sorted array in that case you are doing two shift operations so you can
apply this shifting operations in this unsorted area. delete data from the array so I 'll see you in
the next video till then bye-bye take
