Re:On Binary Search
by smellia on Thursday October 31, 2019 @02:19AM
(#21406156)
Its the opposite. Its easy to write such a loop with unsigned ints: for(x=top;x<=top;x--). However you can't reliably write a loop spanning the whole space with signed ints without breaking the no-overflow rules. With unsigned you can do x=0;do{stuff(x);}while(++x); Good luck doing this with signed ints.
[ Parent
| on HN ]
There are no comments on this comment yet.