Скачать или смотреть Data Structure and Algorithms: Arrays by Arfan Shahzad in Urdu

Arrays are the collection of similar type of data items stored at contiguous memory locations. Arrays are the derived data type in which can store the primitive type of data such as int, char, double, float, etc. Array is the simplest data structure where each data element can be randomly accessed by using its index number.
An array is always of a fixed size; it does not grow (at run time) as more elements are required.
The programmer must ensure that only valid values in the array are accessed, and must remember the location (maximum size) in the array of each value.
The computational complexity for writing to and accessing an array is O(1). No matter the number of elements in the array.
The computational complexity of inserting an element in the middle of an array is O(N), where N is the number of elements in the array.
The elements in the array must all be shifted up one index after the insertion.
The same way, computational complexity of deleting an element from the middle of an array is O(N), where N is the number of elements in the array.
The elements in the array must all be shifted down one index after the deletion.