int main(void)
{
int tmparr[TEST_SIZE];
int multiplier = 1;
plan_tests(4);
pseudo_random_array(tmparr, TEST_SIZE);
ok1(!is_sorted(tmparr, TEST_SIZE));
ok1(!is_reverse_sorted(tmparr, TEST_SIZE));
asort(tmparr, TEST_SIZE, test_cmp, &multiplier);
ok1(is_sorted(tmparr, TEST_SIZE));
pseudo_random_array(tmparr, TEST_SIZE);
multiplier = -1;
asort(tmparr, TEST_SIZE, test_cmp, &multiplier);
ok1(is_reverse_sorted(tmparr, TEST_SIZE));
return exit_status();
}
void callASort(T* buff, size_t size, T*(*asort)(T* buff, size_t n), LPCTSTR fileOut)
{
T* forSort = duplicateBuff(buff, size);
T* sortRes = asort(forSort, size);
if (outputOutput)
outputBuff(sortRes, size);
writefile(fileOut, sortRes, size);
delete[] forSort;
}
static void sort_files(struct list_head *list)
{
struct ccan_file **files = tal_arr(NULL, struct ccan_file *, 0), *f;
unsigned int i;
while ((f = list_top(list, struct ccan_file, list)) != NULL) {
tal_expand(&files, &f, 1);
list_del(&f->list);
}
asort(files, tal_count(files), cmp_names, NULL);
for (i = 0; i < tal_count(files); i++)
list_add_tail(list, &files[i]->list);
tal_free(files);
}
int main() {
int n,i,ei=0,oi=0;
scanf("%d",&n);
int arr[n],even[n],odd[n];
for(i=0;i<n;i++) {
even[i]=odd[i]=0;
}
for(i=0;i<n;i++) {
scanf("%d",&arr[i]);
if( arr[i] & 1 ) odd[oi++] = arr[i];
else even[ei++] = arr[i];
}
asort(even,n);
dsort(odd,n);
}
