Adds efficient sort algorithm to KNearest

This commit is contained in:
lopespt 2018-04-04 09:35:58 -03:00
parent 7bc980edaf
commit 65d816c3b5

View File

@ -240,20 +240,7 @@ public:
else
{
float* rp = rbuf + testidx*k;
for( j = k-1; j > 0; j-- )
{
bool swap_fl = false;
for( i = 0; i < j; i++ )
{
if( rp[i] > rp[i+1] )
{
std::swap(rp[i], rp[i+1]);
swap_fl = true;
}
}
if( !swap_fl )
break;
}
std::sort(rp, rp+k);
result = rp[0];
int prev_start = 0;