I dont understand how to make the odd function

#1
#2

okay, follow this approach
take four pointers and initialise all to NULL
oddend and evenend to store the ends of even number and odd numbers
and oddstart and evenstart to store the beginning of them
check the first node if it is odd or even and point oddstart or evenstart accordingly
now for temp = head->next start running a loop
in the loop:
if an odd number is encountered and if oddstart is NULL point oddstart to it else if oddstart->next==NULL point odd end else point oddend->next to this temp and move oddend to it next
similarly follow the simlar steps for even numbers
at the end of the loop point oddend to even start and return oddstart as your new head

#3

i dont able to understand what u have said…plz give in code form.

#4

or explain it nicely…

#5

node *oddeven(node *head)
{
if(head==NULL || head->next ==NULL)
return head;
node *oddend = NULL;
node *evenend = NULL;
node *oddstart = NULL;
node *evenstart = NULL;
if( head is odd)
oddstart = head;
else
evenstart = head;
head = head->next;
while(head!=NULL)
{
if(head is odd)
{ if(oddstart = NULL;
oddstart = head
else
oddend = head
}
else
{
if evenstart == null
evenstart = head;
else
evenend = head;
}
head = head->next;
}
oddend->next = evenstart
return oddstart
}

#6

Plz check why testcases are getting failed https://ide.codingblocks.com/s/202494

#7

btao yr…its been 24 hrs

#8


hey the code i gave was psuedo for understanding only