Array
A finite ordered set of homogeneous elements is called an array.
Where,
Finite means elements are countable.
Ordered set means that each element of the set has a unique position i.e. ordering is imposed on the elements.
Homogeneous means that all the elements of the set are of same type i.e. they may be real, integer or character.Reed more..
IMPORTANT LINKS HEAR:
Array | Types of Arrays | Passing Array to Functions | Declaration of Array | Initializing Arrays | Difference between an Array and an Ordinary Variable
LINKS:
Array | Types of Arrays | Declaration of Array | Initializing Arrays | Difference between an Array and an Ordinary Variable | String | Declaring a string | Initializing a string | Different functions used to Input of Strings Data | Different Functions used to Output of strings data | Pointer | There are number of reasons for using pointers | Difference between An Array and Pointer | Storage Class | In C, there are four types of storage classes as below | Algorithm | Characteristics/Qualities of a good Algorithm | Flow Chart
ALL LINKS HEAR:
Array | Types of Arrays | Passing Array to Functions | Declaration of Array | Initializing Arrays | Difference between an Array and an Ordinary Variable
LINKS:
Array | Types of Arrays | Declaration of Array | Initializing Arrays | Difference between an Array and an Ordinary Variable | String | Declaring a string | Initializing a string | Different functions used to Input of Strings Data | Different Functions used to Output of strings data | Pointer | There are number of reasons for using pointers | Difference between An Array and Pointer | Storage Class | In C, there are four types of storage classes as below | Algorithm | Characteristics/Qualities of a good Algorithm | Flow Chart
ALL LINKS HEAR:
Good ur hardworks.keep it up.
ReplyDeleteThank uuuuu..
ReplyDelete