）创建任意字符型有序（递增排序）单循环链表（即链表的字符元素随机在键盘上输入），长度限定在15之内；

2）打印（遍历）该链表（依次打印出表中元素值）；

3）在链表中查找第i个元素，i合法返回元素值，否则，返回FALSE；

4）在链表中查找与一已知字符相同的第一个结点，有则返回TRUE，否则，返回FALSE；

5）在链表中按照有序方式插入一已知字符元素；

6）在线性表中删除第i个结点；

7）计算链表的长度。

-) To create any character and orderly (Sort Ascending) monocyclic list (that is, elements of random list of characters on your keyboard input), the length limit of 15　2) Print (traverse) the list (followed by print table of elements in value)　3) in the list to find the first i elements, i legitimate return element values, or else return FALSE　4) in the list to find the same with a known characters of the first node, I would return TRUE, otherwise, return FALSE　5) in the list in an orderly manner in accordance with the insertion of a known character elements　6) line of the table to delete the first i nodes　7) calculated the length of list.