Description: In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list (such a number is called the kth order statistic.) This includes the cases of finding the minimum, maximum, and median elements. There are worst-case linear time selection algorithms. Selection is a subproblem of more complex problems like the nearest neighbor problem and shortest path problems.
To Search:
File list (Check if you may need any files):
select
......\select
......\......\bin
......\......\...\Debug
......\......\...\.....\select.exe
......\......\...\.....\select.pdb
......\......\...\.....\select.vshost.exe
......\......\...\.....\select.xml
......\......\Module1.vb
......\......\My Project
......\......\..........\Application.Designer.vb
......\......\..........\Application.myapp
......\......\..........\AssemblyInfo.vb
......\......\..........\Resources.Designer.vb
......\......\..........\Resources.resx
......\......\..........\Settings.Designer.vb
......\......\..........\Settings.settings
......\......\obj
......\......\...\Debug
......\......\...\.....\select.exe
......\......\...\.....\select.pdb
......\......\...\.....\select.Resources.resources
......\......\...\.....\select.vbproj.GenerateResource.Cache
......\......\...\.....\select.xml
......\......\...\.....\TempPE
......\......\...\select.vbproj.FileListAbsolute.txt
......\......\select.vbproj
......\select.sln
Download