Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- void sort(int *start, int *finish)
- {
- int parn[100], sizea=0, neparn[100], sizeb=0;
- for(int *i=start; i<=finish; i++)
- {
- if(*i%2==0)
- {
- parn[sizea]=*i;
- sizea++;
- }
- else
- {
- neparn[sizeb]=*i;
- sizeb++;
- }
- }
- int *q=parn, *w=neparn, *i=start;
- for(; q<parn+sizea; i++, q++)
- *i=*q;
- for(; w<neparn + sizeb; i++, w++)
- *i=*w;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement