void Sort_incream(uint16_t Arr[DEALY_RANGE] )
{
uint16_t i, j, temp, isSorted;
for(i=0; i<(DEALY_RANGE)-1; i++){
isSorted = 1;
for(j=0; j<(DEALY_RANGE)-1-i; j++){
if(Arr[j] > Arr[j+1]){
temp = Arr[j];
Arr[j] = Arr[j+1];
Arr[j+1] = temp;
isSorted = 0;
}
}
if(isSorted) break;
}
min1 = Arr[0];
min2 = Arr[1];
min3 = Arr[2];
for(int k = 0;k<DEALY_RANGE;k++)
{
ave_sum = ave_sum + Arr[k];
}
ave_num = (double)ave_sum/DEALY_RANGE;
ave_sum = 0;
}