Description: 2.2, linear time selection (divide and conquer strategy) experimental data: input.txt (a total of 100 data)- the minimum required to identify sequence elements in the smallest element in the output to output.txt file
To Search:
- [timeselect] - Solution of linear time option is to des
- [choose] - Linear time selection to find the first
- [2.3] - 2.3 Main elements of the problem (books
File list (Check if you may need any files):
2.2线性选择\2.cpp
...........\2.dsp
...........\2.dsw
...........\2.ncb
...........\2.opt
...........\2.plg
...........\2_2.exe
...........\a.cpp
...........\a.dsp
...........\a.dsw
...........\a.ncb
...........\a.opt
...........\a.plg
...........\Debug\2.exe
...........\.....\2.ilk
...........\.....\2.obj
...........\.....\2.pch
...........\.....\2.pdb
...........\.....\a.exe
...........\.....\a.ilk
...........\.....\a.obj
...........\.....\a.pch
...........\.....\a.pdb
...........\.....\vc60.idb
...........\.....\vc60.pdb
...........\input.txt
...........\output.txt
...........\Debug
2.2线性选择
Download