Introduction - If you have any usage issues, please Google them yourself
1) the creation of any character in an orderly manner (increasing order) the single round-robin list (that is, elements of random list of characters in keyboard input), the length limit of 15 2) Print (traverse) the list (followed by print the table element values) 3) in the list to find the first i elements, i legitimate return element value, otherwise return FALSE 4) in the list to find the same characters with a known first node, a then 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
Packet : 69491749shujujiegoushixi.rar filelist
shujujiegoushixi\数据结构实习报告.doc
shujujiegoushixi\约瑟夫环\Debug
shujujiegoushixi\约瑟夫环\约瑟夫环.cpp
shujujiegoushixi\约瑟夫环\约瑟夫环.dsp
shujujiegoushixi\约瑟夫环\约瑟夫环.dsw
shujujiegoushixi\约瑟夫环\约瑟夫环.ncb
shujujiegoushixi\约瑟夫环\约瑟夫环.opt
shujujiegoushixi\约瑟夫环\约瑟夫环.plg
shujujiegoushixi\约瑟夫环
shujujiegoushixi\重言式判别\Debug
shujujiegoushixi\重言式判别\重言式判别.cpp
shujujiegoushixi\重言式判别\重言式判别.dsp
shujujiegoushixi\重言式判别\重言式判别.dsw
shujujiegoushixi\重言式判别\重言式判别.ncb
shujujiegoushixi\重言式判别\重言式判别.opt
shujujiegoushixi\重言式判别\重言式判别.plg
shujujiegoushixi\重言式判别
shujujiegoushixi