for (i = 0; i < cnt; i = j)
{
for (j = i + 1; j < cnt; j++)
if (values[i] != values[j])
break;
for (i = 0; i < cnt; i = j)
{
for (j = i + 1; j < cnt; j++)
if (values[i] != values[j])
break;
heap_delete (h, heap_minimum (h));
}
check (heap_is_empty (h));
heap_delete (h, heap_minimum (h));
}
check (heap_is_empty (h));
sorted_values = xnmalloc (cnt, sizeof *sorted_values);
elements = xnmalloc (cnt, sizeof *elements);
sorted_values = xnmalloc (cnt, sizeof *sorted_values);
elements = xnmalloc (cnt, sizeof *elements);
heap_delete (h, heap_minimum (h));
}
check (heap_is_empty (h));
heap_delete (h, heap_minimum (h));
}
check (heap_is_empty (h));