Free Web Hosting Provider - Web Hosting - E-commerce - High Speed Internet - Free Web Page
Search the Web

List->Static list->Traversal

Obviously, it is very much what you guessed! It is nothing but reading the list from starting to end, or you can say printing out the LIST.

Algorithm:-
Step-1: Initialize the INDEX value to 0
Step-2: Print out the LIST (array) element for the current INDEX.
Step-3: Increment the INDEX by 1 till the time it is < LISTSIZE; otherwise STOP
Step-4: Go to step-2

C implementation:-
int list[LISTSIZE];
traverse()
{
int index=0;
while (index<LISTSIZE)
   {
    printf("%d ",list[index]);
    index++;

   }
}

Related Operations:
Addition and Deletion of elements
Traversing of list
Searching for a particular Key
Sorting of list in ascending and descending order

Index || Doubts / Clarifications || Related Topics || Web Links