First, find the table length (proof-test), two insert elements operating (proof-test), three delete operation (proof-test), four, look for the positioning element (proof-test), five, seeking maximum table value of the element, return main () function in front, perfect complement function Tmax (), then here call completion (design type test)

实验一
......\Debug
......\.....\text.pch
......\.....\vc60.idb
......\.....\vc60.pdb
......\.....\顺序表实现及应用.exe
......\.....\顺序表实现及应用.ilk
......\.....\顺序表实现及应用.obj
......\.....\顺序表实现及应用.pch
......\.....\顺序表实现及应用.pdb
......\text.cpp
......\text.dsp
......\text.dsw
......\text.ncb
......\text.opt
......\text.plg
......\实验一.doc
......\顺序表实现及应用.cpp
......\顺序表实现及应用.dsp
......\顺序表实现及应用.dsw
......\顺序表实现及应用.ncb
......\顺序表实现及应用.opt
......\顺序表实现及应用.plg

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．