ARRAY OPRATIONS.

DATA STRUCTURE

NAME:-RAVAL MITHIL R.
BRANCH:-IT
ENROLL . NO:-IT223
SUBJECT:-DATA STRUCTURE
Operation on Array Data Structure
Traversal
Selection
Searching
Insertion
Deletion
Sorting
Traversal
•Traversal is operation in which each element
of a list, stored in an array, is visited.
•The travel proceeds from the zero element
to the last element of the list.
Selection
•An array allows selection of an element for
given index.
•Array is called as random access data
structure
Searching
•Searching is an operation in which a given
list is searched for a particular value.
•A list can be searched sequentially where in
the search for the data item starts from the
beginning and continues till the end off the
list. This method is called linear search
Deletion
•Deletion is the operation that remove an
element from a given location of the list.
•To delete an element from the ith location of

the list, then all elements from the right

i+1th location have to be shifted one step
towards left to preserve contiguous locations
in the array
Insertion
•Insertion is the operation that inserts an
element at a given location of the list.
•To insert an element at ith location of the list

,then all element from right of i+1th

location have to be shifted one step towards
right.
Sorting
•Sorting technique to arranging data in a
particular format. Sorting algorithm specifies
the way to arrange data in a particular order.
•Most common are numerical order.
•Sorting is also used to represent data in

more readable formate.

THANKS FOR WATCHING