42 for (
int i=1; i<n; i++)
50 assert((n > 0) && (m > 0));
61 }
while ((i < n) && (j < m));
bool duplicates(void **p, int n)
Check whether p has duplicates among its n elements (changes p)
void quicksort(Type *l, Type *r, Less &less)
Standard quick sort.
Gecode toplevel namespace