How to write plain english algos for this?

[apnamian]

1. Write the algorithm for the array implementation of the following for simple lists. Assume that the maximum size of the list is 25
* ClearList
* ListEmpty
* ListFull
* ListSize
2. Write the algorithm for the linked list implementation of the following for simple lists.
* ClearList
* ListEmpty
* ListFull
* ListSize
3. Write an algorithm to move the entries in a stack onto the top of another stack in such a way that the entries that were in the first stack keep the same relative order.
4. Write an algorithm to implement a queue in a linear array with two indices, front and rear, such that when rear reaches the end of the array, all the entries are moved to the front positions of the array.
5. If a queue is implemented as a circularly linked list, then we need only one pointer: tail, to locate both the front and rear. Write the algorithms to append and serve nodes for this structure.

[int main]

You know, a question usually ends with a question mark.

That looks somewhat like his ---> ?.

kind regards

int main

P.S.: Use the search function: Enter "We don't do homework". You will find good answers

[Zaita]

http://www.cplusplus.com/forum/articles/1295/