linear data structures<\/a>, the elements are arranged in sequence one after the other. Since elements are arranged in particular order, they are easy to implement.
\nHowever, when the complexity of the program increases, the linear data structures might not be the best choice because of operational complexities.
\nPopular linear data structures are:<\/p>\nArray:<\/h3>\n
Arrays are defined as the collection of similar types of data items stored at contiguous memory locations. It is one of the simplest data structures where each data element can be randomly accessed by using its index number.
\nIn C programming, they are the derived data types that can store the primitive type of data such as int, char, double, float, etc. For example, if we want to store the marks of a student in 6 subjects, then we don’t need to define a different variable for the marks in different subjects. Instead, we can define an array that can store the marks in each subject at the contiguous memory locations.<\/p>\n
Representation of an array<\/h3>\n
We can represent an array in various ways in different programming languages. As an illustration, let’s see the declaration of array in C language –<\/p>\n
![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1663586255407-1-01.png\")
<\/p>\n
As per the above illustration, there are some of the following important points –
\nIndex starts with 0.
\nThe array’s length is 10, which means we can store 10 elements.
\nEach element in the array can be accessed via its index.<\/p>\n
Implementation:<\/h3>\n\t\t\t\t\t\t
![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1663157318964-TOPIC%20_Data%20Structures%20and%20Algorithms%20Linear%20Data%20Structures.jpg\")
<\/p>\n