Displaying Pyramid

//Displaying pyramid

#include<stdio.h>
#include<conio.h>
main()
{
   int i,j,num;

   char str[]="0123456789";

   printf("enter no. uptill u want to print pyramid\n");

   scanf("%d",&num);

   for(i=0;i<num;i++)
   {
       for(j=i;j<num;j++)
         printf(" ");

         

      /* The above for loop is for giving spaces for pyramid shape .

         As it reaches to num the bottom most of pyramid , spaces decreases*/

        for(j=i;j>=0;j--)
          printf("%d",j);
     

 for(j+=2;j<=i;j++)

          printf("%d",j);
         printf("\n");
   }
   
}

Displaying Multiplication Table uptill Given Number

//multiplication number
#include<stdio.h>
main()
{
   int i,j,t,n;
   printf("\n multiplication table \n Enter Number : ");
   

    scanf("%d",&n);
   

     for(i=1;i<=n;i++)
      printf("\t%d",i);

//The above one for Main column

      printf("\n\n");
   for(j=1;j<=n;j++)
     {

 //The below printf for Main row

       printf("%d",j);

//The below for loop for elements in table

       for(i=1;i<=n;i++)
        printf("\t%d",i*j);
        printf("\n");
     }
}

Sorting of nodes in Linked List(Insertion sort)

#include<stdio.h>
#include<stdlib.h>
struct nod
{
   int data;
   struct nod *llink,*rlink;
};
typedef struct nod *node;
main()
{
   int i,size,count=0,temp1;
   node head,temp,p,q;
   printf("\n enter size\n");
   scanf("%d",&size);
   for(i=0;i<size;i++)
   {
       temp=(node)malloc(sizeof(node));
       printf("\n enter element\n");
       scanf("%d",&temp->data);
       if(!i)
        {
           temp->llink=NULL;
           temp->rlink=NULL;
           head=temp;
        }
        else
        {
           head->rlink=temp;
           temp->llink=head;
           temp->rlink=NULL;
           head=temp;
        }
   }
   while(temp->llink!=NULL)
      temp=temp->llink;
    head=temp;
     printf("\n details entered are\n");
    while(temp!=NULL)
    {
      printf("%d\n",temp->data);
      temp=temp->rlink;
     }
     p=head;
     q=head;
     while(--size)
     {
         count++;
         temp=p->rlink;
          q=p;
          for(i=count;i>0;i--)
          {
             
           if(temp->data<q->data)
           {
               temp1=temp->data;
                temp->data=q->data;
               q->data=temp1;
           }
           q=q->llink;
           temp=temp->llink;
         }
         p=p->rlink;
     }
     printf("\n after sorting\n");
     p=head;
     while(p!=NULL)
     {
       printf("%d\n",p->data);
       p=p->rlink;
     }
      
}