Arrays, Records and Pointers
The Operation one normally performs on any linear structure.
(a) Traversal: Processing each element in the list.
(b) Search: Finding the location of the element with a given value or the record with a given key.
(c) Insertion: Adding a new element to the list
(d) Deletion: Removing an element from the list.
(e) Sorting: Arranging the elements in some type of order.
(f) Merging: Combing two lists into a single list.
If You want to learn about the technology, computer science & engineering, web programming, freelancing, earning please click here :CSE SOLVE
The Operation one normally performs on any linear structure.
(a) Traversal: Processing each element in the list.
(b) Search: Finding the location of the element with a given value or the record with a given key.
(c) Insertion: Adding a new element to the list
(d) Deletion: Removing an element from the list.
(e) Sorting: Arranging the elements in some type of order.
(f) Merging: Combing two lists into a single list.
Posts
0 comments:
Post a Comment