data structure part

2. Deffi:-
1.An array is a collection same data elements
which is do not change during program
execuation.
2.Array are the collection of a finite number of
homogeneous data elements.

3. 3.Array is a container which can hold a fix number of items and these
items should be of the same type. Most of the data structures make use
of arrays to implement their algorithms. Following are the important
terms to understand the concept of Array.
Element − Each item stored in an array is called
an element.
Index − Each location of an element in an array
has a numerical index, which is used to identify
the element.

4. Array Representation:-
Arrays can be declared in various ways in different
languages. For illustration, let's take C array
declaration.
35,33,42,10,14,19,27,44,26,31
Name
Type
Size
Elements

5. 35 33 42 10 14 19 27 44 26 31
0 1 2 3 4 5 6 7 8 9
Elements
Index Value
array([0]=35
array([1]=33
array([2]=42
array([3]=10
array([4]=14
array([5]=19
array([6]=27
array([7]=44
array([8]=26
array([9]=31