Description: One, the purpose of the experiment
1, grasp the concept of precursor, the elements in the table of linear follow-up.
2, grasp the order table creation, and linked list insertion elements, remove elements in the table algorithm.
3, the linear table corresponding to the time complexity of the algorithm is analyzed.
4, understand the characteristics of sequential list, linked list data structure (advantages and disadvantages).
Two, experiment preparation
Explain the following concept
1, the linear table:
2, the order of the table:
3, list:
To Search:
File list (Check if you may need any files):
实验三 串\c1.h
.........\chuan4-2-1.cpp
.........\chuan4-2-2.cpp
.........\chuan4-2-2.dsp
.........\chuan4-2-2.dsw
.........\chuan4-2-2.ncb
.........\chuan4-2-2.opt
.........\chuan4-2-2.plg
.........\chuanhanshu.cpp
.........\Cpp1.cpp
.........\Cpp1.dsp
.........\Cpp1.dsw
.........\Cpp1.ncb
.........\Cpp1.opt
.........\Cpp1.plg
.........\Debug\chuan4-2-2.bsc
.........\.....\chuan4-2-2.exe
.........\.....\chuan4-2-2.ilk
.........\.....\chuan4-2-2.obj
.........\.....\chuan4-2-2.pch
.........\.....\chuan4-2-2.pdb
.........\.....\chuan4-2-2.sbr
.........\.....\Cpp1.bsc
.........\.....\Cpp1.exe
.........\.....\Cpp1.ilk
.........\.....\Cpp1.obj
.........\.....\Cpp1.pch
.........\.....\Cpp1.pdb
.........\.....\Cpp1.sbr
.........\.....\vc60.idb
.........\.....\vc60.pdb
.........\Debug
实验三 串
Download