1.Insert 1 value/element into the Array (type : int)
2.Delete 1 value/element from the Array
3.Linear Search an Element from the Array
4.Sort the Array into Ascending format using Selection Sort
5.Traverse(Display the contents of the Array)
The Array Size is currently defined as 20 that is the array can hold upto 20 Elements
PS: If required, I would like to increase the functionality of this Program such as including the Return Addresses of each element inside the Array or display the difference between various sorting algorithms.
With this Program you can :
1.Insert 1 value/element into the Array (type : int)
2.Delete 1 value/element from the Array
3.Linear Search an Element from the Array
4.Sort the Array into Ascending format using Selection Sort
5.Traverse(Display the contents of the Array)
The Array Size is currently defined as 20 that is the array can hold upto 20 Elements
PS: If required, I would like to increase the functionality of this Program such as including the Return Addresses of each element inside the Array or display the difference between various sorting algorithms.