Description: Quick Sort and the knapsack problem of C++ code, including the use of quick sort of the first element of the array, the last element, as well as the middle element as the pivot of the median.
To Search:
File list (Check if you may need any files):
FastSort&&Knap
..............\FastSort
..............\........\Debug
..............\........\.....\FastSort.exe
..............\........\.....\FastSort.ilk
..............\........\.....\fastsort.obj
..............\........\.....\FastSort.pch
..............\........\.....\FastSort.pdb
..............\........\.....\vc60.idb
..............\........\.....\vc60.pdb
..............\........\fastsort.cpp
..............\........\FastSort.dsp
..............\........\FastSort.dsw
..............\........\FastSort.ncb
..............\........\FastSort.opt
..............\........\FastSort.plg
..............\Knap.cpp
Download