else if(p->data > q->data)
{ while(q!=NULL){
m=q->next;
q->next=p;
p->next=m;
q=q->next;
}
}

#include<stdio.h>

struct node{
int data;
node* next;
};

node* insert (node*list, int x)
{node *m=new(node);
node*q=list;
node*p=new(node);
p->data=x;

if(q==NULL)
{p->next=list;
list=p;
return list;}

else if(p->data

#include<stdio.h>
typedef struct {
char name[10];
int salary;
}me;
int main()
{
me a;
a.name="ehab";
a.salary=5789;
printf("%s\n",a.name);
printf("%d",a.salary);
return 0;
}

#include<stdio.h>
int main()
{
typedef struct {
char name[10];
int salary;
}me;
me a;
a.name="ehab";
a.salary=5789;
printf("%s",a.name);
printf("%d",a.salary);
return 0;
}

#include<stdio.h>
void num(char arr[100])
{
int i=0, count=1;
while (arr[i]!='\0')
{
if (arr[i]==' ')
{count++;}
i++;
}
printf("%d",count);
}
int main()
{

char data [100];

scanf("%s",&data);
printf("%s",data);
num(data);
return 0;
}