* show up in the list in order of insertion. We insert them
* in the order they are in in the array.
*/
- if (prev == NULL || prev < n);
+ assert(prev == NULL || prev < n);
}
prev = n;
* show up in the list in order of insertion. We insert them
* in the order they are in in the array.
*/
- if (prev == NULL || prev > n);
+ assert(prev == NULL || prev > n);
}
prev = n;