:( finds 42 in {39,40,41,42}
\ expected an exit code of 0, not 1
( it meaning I missing or have a return error??? )
bool search(int value, int values[], int n)
{// start of search code
// TODO: implement a searching algorithm
if ( n <= 0)
{
return false;
}
//search for middle lists if min = target
if (value == values[(n + 1) / 2])
{
return true;
}
//number greater search left
if ( value > values[(n + 1)/ 2 ])
{
return search(value, &values[n / 2 + 1], n - n / 2 - 1);
}
/number smaller search right
else if (value < values[(n + 1)/ 2 ])
{
return search( value, values, n/2);
}
return false;
}// end of search code
void sort(int values[], int n)
{//start of selection sort code
// TODO: implement a sorting algorithm (selection sort)
int min, swap;
for (int i = 0; i < n - 1; i++)
{
min = i;
for (int j = i + 1; j < n; j++)
if (values[j] < values[min])
min = j;
//swap number
if (min != i)
{
swap = values[i];
values[i] = values[min];
values[min] = swap;
}
return;
}
}//End of selection sort