overflow by comparaison

[maturainfankam]

hi,
i have design a priority Queuing for value comparaison, the heap is always the smaller value.
1 - the value to compare are update dynamic ( with some add operation)
2 - the value to compare are represented with 16 Bit => when i update the values, we can get a overflow and the comparaison is not anymore correct.
how can i deal with these problem.
Best regards.
maturain

 

[kalbun]

If you get an overflow then 16 bits are obviously not enough. You can use 32-bit instead.
If you only have problems with the comparison operation, copy the values to compare in 32-bit operands before performing the operation.