c data structures

C Program to search the linked list.

Posted on by Sandeepa Nadahalli
Data structures using C,
Write c program to search the linked list.
Linked list is a data structure in which the objects are arranged in a linear order. In this program, we sort the list elements in ascending order. Read more about C Programming Language . and read the C Programming Language (2nd Edition). by K and R. 

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/

#include<stdio.h>
#include<conio.h>
#include<malloc.h>
struct l_list
{
    int info;
    struct link *next;
}
start, *node;

int search(int);
void main()
{
    int no,i,item,pos;
    clrscr();
    start.next=NULL;
    node=&start;
    printf("How many nodes, you want in linked list? ");
    scanf("%d",&no);
    printf("");
    for(i=0;i<no;i++)
    {
        node->next=(struct l_list *)malloc(sizeof(struct l_list));
        printf("Enter element in node %d: ",i+1);
        scanf("%d",&node->info);
        node=node->next;
    }
    node->next=NULL;
    printf("Linked list(only with info field) is:");
    
    node=&start;
    while(node->next!=NULL)
    {
        printf("%d    ",node->info);
        node=node->next;
    }
    printf("
    
    Enter item to be searched : ");
    scanf("%d",&item);
    pos=search(item);
    if(pos<=no)
    printf("Your item is at node %d",pos);
    else
    printf("Sorry! item is no in linked list.a");
    getch();
}

int search(int item)
{
    int n=1;
    node=&start;
    while(node->next!=NULL)
    {
        if(node->info==item)
        break;
        else
        n++;
        node=node->next;
    }
    return n;
}
Read more Similar C Programs
Data Structures

Learn C Programming

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link
(c) www.c-program-example.com

C Program to implement Simpson method.

Posted on by Sandeepa Nadahalli
Write a C Program to implement Simpson method.
Simpson method is used for approximating integral of the function.
Simpson’s rule also corresponds to the 3-point Newton-Cotes quadrature rule.
In this program, We use the stack to implement the Simpson method. Read more about C Programming Language .

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/

#include<stdio.h>

#include<conio.h>

#include<math.h>

char post_fix[80];

float stack[80];

char stack1[80];

int top=-1,top1=-1;

float eval(char post_fix[], float x1);

void infix_post_fix(char infix[]);

main()

{
    
    float x0, xn, h, s,e1,e2, e3;
    
    char exp[80], arr[80];
    
    int i,n,l=0;
    
    clrscr();
    
    printf("nEnter an expression: nn");
    
    gets(exp);
    
    puts("nnEnter x0, xn and number of sub-intervals: nn");
    
    scanf("%f%f%d", &x0, &xn, &n);
    
    h=(xn-x0)/n;
    
    if(exp[0]=='l'&& exp[1]=='o'&& exp[2]=='g')
    
    {
        
        l=strlen(exp);
        
        for(i=0;i<l-3; i++)
        
        arr[0]=exp[i+3];
        
        arr[i]=";
        
        infix_post_fix(arr);
        
        e1=eval(post_fix,x0);
        
        e2=eval(post_fix,xn);
        
        e3=4*eval(post_fix, x0+h);
        
        s=log(e1)+log(e2)+log(e3);
        
        for (i=3;i<=n-1;i+=2)
        
        s+=4*eval(post_fix,x0+i*h)+2*eval(post_fix, x0+(i-1)*h);
        
    }
    
    else
    
    {
        
        infix_post_fix(exp);
        
        s=eval(post_fix,x0)+eval(post_fix,xn)+4*eval(post_fix, x0+h);
        
        for (i=3;i<=n-1;i+=2)
        
        s+=4*eval(post_fix,x0+i*h)+2*eval(post_fix, x0+(i-1)*h);
        
    }
    
    printf("nnThe value of integral is %6.3fn",(h/3)*s);
    
    return(0);
    
}

/*Inserting the operands in a stack. */

void push(float item)

{
    
    if(top==99)
    
    {
        
        printf("ntThe stack is full");
        
        getch();
        
        exit(0);
        
    }
    
    else
    
    {
        
        top++;
        
        stack[top]=item;
        
    }
    
    return;
    
}

/*Removing the operands from a stack. */

float pop()

{
    
    float item;
    
    if(top==-1)
    
    {
        
        printf("ntThe stack is emptynt");
        
        getch();
        
    }
    
    item=stack[top];
    
    top–;
    
    return (item);
    
}

void push1(char item)

{
    
    if(top1==79)
    
    {
        
        printf("ntThe stack is full");
        
        getch();
        
        exit(0);
        
    }
    
    else
    
    {
        
        top1++;
        
        stack1[top1]=item;
        
    }
    
    return;
    
}

/*Removing the operands from a stack. */

char pop1()

{
    
    char item;
    
    if(top1==-1)
    
    {
        
        printf("ntThe stack1 is emptynt");
        
        getch();
        
    }
    
    item=stack1[top1];
    
    top1–-;
    
    return (item);
    
}

/*Converting an infix expression to a postfix expression. */

void infix_post_fix(char infix[])

{
    
    int i=0,j=0,k;
    
    char ch;
    
    char token;
    
    for(i=0;i<79;i++)
    
    post_fix[i]=' ';
    
    push1('?');
    
    i=0;
    
    token=infix[i];
    
    while(token!=")
    
    {
        
        if(isalnum(token))
        
        {
            
            post_fix[j]=token;
            
            j++;
            
        }
        
        else if(token=='(')
        
        {
            
            push1('(');
            
        }
        
        else if(token==')')
        
        {
            
            while(stack1[top1]!='(')
            
            {
                
                ch=pop1();
                
                post_fix[j]=ch;
                
                j++;
                
            }
            
            ch=pop1();
            
        }
        
        else
        
        {
            
            while(ISPriority(stack1[top1])>=ICP(token))
            
            {
                
                ch=pop1();
                
                post_fix[j]=ch;
                
                j++;
                
            }
            
            push1(token);
            
        }
        
        i++;
        
        token=infix[i];
        
    }
    
    while(top1!=0)
    
    {
        
        ch=pop1();
        
        post_fix[j]=ch;
        
        j++;
        
    }
    
    post_fix[j]=";
    
}

/*Determining the priority of elements that are placed inside the stack. */

int ISPriority(char token)

{
    
    switch(token)
    
    {
        
        case '(':return (0);
        
        case ')':return (9);
        
        case '+':return (7);
        
        case '-':return (7);
        
        case '*':return (8);
        
        case '/':return (8);
        
        case '?':return (0);
        
        default: printf("nnInvalid expression");
        
    }
    
    return 0;
    
}

/*Determining the priority of elements that are approaching towards the stack. */

int ICP(char token)

{
    
    switch(token)
    
    {
        
        case '(':return (10);
        
        case ')':return (9);
        
        case '+':return (7);
        
        case '-':return (7);
        
        case '*':return (8);
        
        case '/':return (8);
        
        case ":return (0);
        
        default: printf("nnInvalid expression");
        
    }
    
    return 0;
    
}

/*Calculating the result of expression, which is converted in postfix notation. */

float eval(char p[], float x1)

{
    
    float t1,t2,k,r;
    
    int i=0,l;
    
    l=strlen(p);
    
    while(i<l)
    
    {
        
        if(p[i]==’x')
        
        push(x1);
        
        else
        
        if(isdigit(p[i]))
        
        {
            
            k=p[i]-'0′;
            
            push(k);
            
        }
        
        else
        
        {
            
            t1=pop();
            
            t2=pop();
            
            switch(p[i])
            
            {
                
                case '+':k=t2+t1;
                
                break;
                
                case '-':k=t2-t1;
                
                break;
                
                case '*':k=t2*t1;
                
                break;
                
                case '/':k=t2/t1;
                
                break;
                
                default: printf("ntInvalid expression");
                
            }
            
            push(k);
            
        }
        
        i++;
        
    }
    
    if(top>0)
    
    {
        
        printf("You have entered the operands more than the operatorsnn");
        
        exit(0);
        
    }
    
    else
    
    {
        
        r=pop();
        
        return (r);
        
    }
    
    return 0;
    
}

Read more Similar C Programs
Data Structures

Learn C Programming

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link
(c) www.c-program-example.com

C Program to convert from infix expression into prefix expression

Posted on by Sandeepa Nadahalli
C Program to convert from infix expression into prefix expression.
We use the infix expressions for the mathematical expressions in a program, these expressions will converted into equivalent machine instructions by the compiler using stacks.
Using stacks we can efficiently convert the expressions from infix to postfix, infix to prefix, postfix to infix, and postfix to prefix.
Example: infix to prefix:
infix: x^y^z-m+n+p/q,
postfix: ++-^x^yzmn/pq. Read more about C Programming Language.

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/


#include<stdio.h>

#include<conio.h>

//Stack precedence function

 int F(char symbol)

  {

      switch(symbol)

               {

                   case ‘+’ :

                   case ‘-‘ :

                          return 1;

                   case ‘*’:

                  case ‘^’:

                         return 6:

                case ‘)’:

                       return 0:;

                case ‘#’:

                       return -1;

                  default:

                       return 8;

                       }

      }

//Input precedence function

int G(char symbol)

    {

      switch(symbol)

            {

               case ‘+’ :

               case ‘-‘ :

                      return 2;

               case ‘*’:

                     return 4;

               case ‘^’:

                     return  5:

                case ‘(‘:

                    return 0;

                 case ‘)’:

                   return 9:;

                 case ‘#’:

                 return -1;

               default:

                  return 7;

              }

}

Void infix_prefix(char infix[], char prefix[])

{

      int top, j, i;

     char symbol, s[40];

      top = -1;

      s[++top] = ‘#’;

      J = 0;

      strrev(infix);

     for(i = 0;i < strlen(infix); i++)

          {

              symbol= infix[i];

              while(F(s[top]) > G(symbol))

                     {

                             prefix[j] = s[top--];

                             j++;

                      }

              if(F(s[top]) != G(symbol))

              s[++top] = symbol;

             else

                       top--;

             }

  while(s[top != ‘#’)

      {

           prefix[j++] = s[top--];

       }

 prefix[j] = ‘’;

 strrev(prefix);

}

void main()

   {

     char infix[20];

     char prefix[20];

    printf(“/nEnter a valid infix expressionn”);

    scanf(“%s”,infix);

    infix_prefix(infix, prefix);

    printf(“nnThe prefix expression isn”);

   printf(“%sn”,prefix);

  }


Read more Similar C Programs
C Basic
C Data Structure
Search Algorithms.

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link
(c) www.c-program-example.com

C Program to implement Priority Queue using structure.

Posted on by Sandeepa Nadahalli
Data structures using C,
Write a C Program to implement Priority Queue using structure.
Priority QUEUE is a abstract data type in which the objects are inserted with respect to certain priority. In this program, we created the simple ascending order priority queue using the structure, here items are inserted in ascending order. Structure is a c composite data type, in which we can define all the data types under the same name or object.Read more about C Programming Language .

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/


#define SIZE 5            /* Size of Queue */
int f=0,r=-1;       /* Global declarations */
typedef struct PRQ
{
 int ele;
 int pr;
}PriorityQ;

PriorityQ PQ[SIZE];

PQinsert(int elem, int pre)
{
 int i;       /* Function for Insert operation */
 if( Qfull()) printf("nn Overflow!!!!nn");
 else
 {
  i=r;
  ++r;
  while(PQ[i].pr >= pre && i >= 0) /* Find location for new elem */
  {
   PQ[i+1]=PQ[i];
   i--;
  }
  PQ[i+1].ele=elem;
  PQ[i+1].pr=pre;
 }
}

PriorityQ PQdelete()
{                      /* Function for Delete operation */
 PriorityQ p;
 if(Qempty()){ printf("nnUnderflow!!!!nn");
 p.ele=-1;p.pr=-1;
 return(p); }
 else
 {
  p=PQ[f];
  f=f+1;
  return(p);
 }
}

int Qfull()
{                     /* Function to Check Queue Full */
 if(r==SIZE-1) return 1;
 return 0;
}

int Qempty()
{                    /* Function to Check Queue Empty */
 if(f > r) return 1;
 return 0;
}

display()
{                  /* Function to display status of Queue */
 int i;
 if(Qempty()) printf(" n Empty Queuen");
 else
 {
  printf("Front->");
  for(i=f;i<=r;i++)
   printf("[%d,%d] ",PQ[i].ele,PQ[i].pr);
  printf("<-Rear");
 }
}

main()
{                         /* Main Program */
 int opn;
 PriorityQ p;
 do
 {
  clrscr();
  printf("n ### Priority Queue Operations(DSC order) ### nn");
  printf("n Press 1-Insert, 2-Delete,3-Display,4-Exitn");
  printf("n Your option ? ");
  scanf("%d",&opn);
  switch(opn)
  {
  case 1: printf("nnRead the element and its Priority?");
  scanf("%d%d",&p.ele,&p.pr);
  PQinsert(p.ele,p.pr); break;
  case 2: p=PQdelete();
  if( p.ele != -1)
   printf("nnDeleted Element is %d n",p.ele);
  break;
  case 3: printf("nnStatus of Queuenn");
  display(); break;
  case 4: printf("nn Terminating nn"); break;
  default: printf("nnInvalid Option !!! Try Again !! nn");
  break;
  }
  printf("nnnn  Press a Key to Continue . . . ");
  getch();
 }while(opn != 4);
}


Read more Similar C Programs
Data Structures

Learn C Programming

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link
(c) www.c-program-example.com

C Program for Simple DSC order Priority QUEUE Implementation

Posted on by Sandeepa Nadahalli
Data structures using C,Priority QUEUE is a abstract data type in which the objects are inserted with respect to certain priority. In this program, we created the simple descending order priority queue, here items are inserted in descending order. Read more about C Programming Language .

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/
#define SIZE 5            /* Size of Queue */
int PQ[SIZE],f=0,r=-1;       /* Global declarations */

PQinsert(int elem)
{
 int i;       /* Function for Insert operation */
 if( Qfull()) printf("nn Overflow!!!!nn");
 else
 {
  i=r;
  ++r;
  while(PQ[i] <= elem && i >= 0) /* Find location for new elem */
  {
   PQ[i+1]=PQ[i];
   i--;
  }
  PQ[i+1]=elem;
 }
}

int PQdelete()
{                      /* Function for Delete operation */
 int elem;
 if(Qempty()){ printf("nnUnderflow!!!!nn");
 return(-1); }
 else
 {
  elem=PQ[f];
  f=f+1;
  return(elem);
 }
}

int Qfull()
{                     /* Function to Check Queue Full */
 if(r==SIZE-1) return 1;
 return 0;
}

int Qempty()
{                    /* Function to Check Queue Empty */
 if(f > r) return 1;
 return 0;
}

display()
{                  /* Function to display status of Queue */
 int i;
 if(Qempty()) printf(" n Empty Queuen");
 else
 {
  printf("Front->");
  for(i=f;i<=r;i++)
   printf("%d ",PQ[i]);
  printf("<-Rear");
 }
}

main()
{                         /* Main Program */
 int opn,elem;
 do
 {
  clrscr();
  printf("n ### Priority Queue Operations(DSC order) ### nn");
  printf("n Press 1-Insert, 2-Delete,3-Display,4-Exitn");
  printf("n Your option ? ");
  scanf("%d",&opn);
  switch(opn)
  {
  case 1: printf("nnRead the element to be Inserted ?");
  scanf("%d",&elem);
  PQinsert(elem); break;
  case 2: elem=PQdelete();
  if( elem != -1)
   printf("nnDeleted Element is %d n",elem);
  break;
  case 3: printf("nnStatus of Queuenn");
  display(); break;
  case 4: printf("nn Terminating nn"); break;
  default: printf("nnInvalid Option !!! Try Again !! nn");
  break;
  }
  printf("nnnn  Press a Key to Continue . . . ");
  getch();
 }while(opn != 4);
}


Read more Similar C Programs
Data Structures

Learn C Programming

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link
(c) www.c-program-example.com

C Program for Simple ASC order Priority QUEUE Implementation

Posted on by Sandeepa Nadahalli
Data structures using C,Priority QUEUE is a abstract data type in which the objects are inserted with respect to certain priority. In this program, we created the simple ascending order priority queue, here items are inserted in ascending order. Read more about C Programming Language .

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/
#define SIZE 5            /* Size of Queue */
int PQ[SIZE],f=0,r=-1;       /* Global declarations */

PQinsert(int elem)
 {
 int i;       /* Function for Insert operation */
  if( Qfull()) printf("nn Overflow!!!!nn");
  else
   {
    i=r;
    ++r;
    while(PQ[i] >= elem && i >= 0) /* Find location for new elem */
     {
      PQ[i+1]=PQ[i];
      i--;
      }
     PQ[i+1]=elem;
   }
  }

int PQdelete()
 {                      /* Function for Delete operation */
  int elem;
  if(Qempty()){ printf("nnUnderflow!!!!nn");
  return(-1); }
  else
   {
   elem=PQ[f];
   f=f+1;
   return(elem);
   }
 }

 int Qfull()
  {                     /* Function to Check Queue Full */
    if(r==SIZE-1) return 1;
    return 0;
  }

 int Qempty()
  {                    /* Function to Check Queue Empty */
    if(f > r) return 1;
    return 0;
  }

  display()
   {                  /* Function to display status of Queue */
    int i;
    if(Qempty()) printf(" n Empty Queuen");
    else
     {
      printf("Front->");
      for(i=f;i<=r;i++)
 printf("%d ",PQ[i]);
      printf("<-Rear");
     }
   }

  main()
  {                         /* Main Program */
   int opn,elem;
   do
    {
     clrscr();
     printf("n ### Priority Queue Operations(ASC order) ### nn");
     printf("n Press 1-Insert, 2-Delete,3-Display,4-Exitn");
     printf("n Your option ? ");
     scanf("%d",&opn);
     switch(opn)
      {
       case 1: printf("nnRead the element to be Inserted ?");
        scanf("%d",&elem);
        PQinsert(elem); break;
       case 2: elem=PQdelete();
        if( elem != -1)
    printf("nnDeleted Element is %d n",elem);
        break;
       case 3: printf("nnStatus of Queuenn");
        display(); break;
       case 4: printf("nn Terminating nn"); break;
       default: printf("nnInvalid Option !!! Try Again !! nn");
  break;
      }
      printf("nnnn  Press a Key to Continue . . . ");
      getch();
      }while(opn != 4);
   }


Read more Similar C Programs
Data Structures

Learn C Programming

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link
(c) www.c-program-example.com

C Program to implementing two Stacks on Single Array.

Posted on by Sandeepa Nadahalli
Data structures using C, Stack is a data structure in which the objects are arranged in a non linear order. In stack, elements are aded or deleted from only one end, i.e. top of the stack. In this program, we implement the two stacks using the single array. Read more about C Programming Language .

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/
#define SIZE 10            /* Size of Stack */
int s[SIZE],top[3]={0,-1,SIZE};
       /* Global declarations */
push(int elem,int stno)
 {
  int pos;      /* Function for PUSH operation */
  if( Sfull()) printf("nn Overflow!!!!nn");
  else
   {
    if(stno==1) pos= ++top[stno];
     else pos=--top[stno];
    s[pos]=elem;
    }
  }


int pop(int stno)
 {                      /* Function for POP operation */
  int elem,pos;
  if(Sempty(stno)){ printf("nnUnderflow!!!!nn");
  return(-1); }
  else
   {
    pos=top[stno];
    elem=s[pos];
    if(stno == 1)top[stno]--;
    else
    top[stno]++;
    return(elem);
   }
 }

 int Sfull()
  {                     /* Function to Check Stack Full */
    if(top[1] == top[2]-1) return 1;
    return 0;
  }

 int Sempty(stno)
  {
      /* Function to Check Stack Empty */
    switch(stno)
    {
    case 1: if(top[1] == -1) return 1; else return 0;
    case 2: if(top[2] == SIZE) return 1;else return 0;
    }
  }

  display(int stno)
   {                  /* Function to display status of Stack */
    int i;
    if(Sempty(stno)) printf(" n Empty Stackn");
    else
     {
     if(stno == 1)
     {
      for(i=0;i<=top[stno];i++)
 printf("%dn",s[i]);
      printf("^Top");
     }
     else
     {
     for(i=SIZE-1;i>=top[stno];i--)
 printf("%dn",s[i]);
      printf("^Top");
     }
   }
   }

  main()
  {                         /* Main Program */
   int opn,elem,stno;
   do
    {
     clrscr();
     printf("n ### Stack Operations ### nn");
     printf("n Stack Number (1,2): ");
     scanf("%d",&stno);
     printf("n Press 1-Push, 2-Pop,3-Display,4-Exitn");
     printf("n Your option ? ");
     scanf("%d",&opn);

     switch(opn)
      {
       case 1: printf("nnRead the element to be pushed ?");
        scanf("%d",&elem);
        push(elem,stno); break;
       case 2: elem=pop(stno);
        if( elem != -1)
    printf("nnPopped Element is %d n",elem);
        break;
       case 3: printf("nnStatus of Stack %d nn",stno);
        display(stno); break;
       case 4: printf("nn Terminating nn"); break;
       default: printf("nnInvalid Option !!! Try Again !! nn");
  break;
      }
      printf("nnnn  Press a Key to Continue . . . ");
      getch();
      }while(opn != 4);
   }


Read more Similar C Programs
Data Structures

Learn C Programming

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link
(c) www.c-program-example.com

C Program to implement Floyd’s Algorithm

Posted on by Sandeepa Nadahalli
Data structures using C, Here we solve the Floyd’s algorithm using C Programming Language. Floyd’s algorithm uses to find the least-expensive paths between all the vertices in a Graph. 

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/

#include<stdio.h>
#include<conio.h>
int min(int,int);
void floyds(int p[10][10],int n)
{
 int i,j,k;
 for(k=1;k<=n;k++)
  for(i=1;i<=n;i++)
   for(j=1;j<=n;j++)
    if(i==j)
     p[i][j]=0;
    else
     p[i][j]=min(p[i][j],p[i][k]+p[k][j]);
}
int min(int a,int b)
{
 if(a<b)
  return(a);
 else
  return(b);
}
void main()
{
 int p[10][10],w,n,e,u,v,i,j;;
 clrscr();
 printf("n Enter the number of vertices:");
 scanf("%d",&n);
 printf("n Enter the number of edges:n");
 scanf("%d",&e);
 for(i=1;i<=n;i++)
 {
  for(j=1;j<=n;j++)
   p[i][j]=999;
 }
 for(i=1;i<=e;i++)
 {
  printf("n Enter the end vertices of edge%d with its weight n",i);
  scanf("%d%d%d",&u,&v,&w);
  p[u][v]=w;
 }
 printf("n Matrix of input data:n");
 for(i=1;i<=n;i++)
 {
  for(j=1;j<=n;j++)
   printf("%d t",p[i][j]);
  printf("n");
 }
 floyds(p,n);
 printf("n Transitive closure:n");
 for(i=1;i<=n;i++)
 {
  for(j=1;j<=n;j++)
   printf("%d t",p[i][j]);
  printf("n");
 }
 printf("n The shortest paths are:n");
 for(i=1;i<=n;i++)
  for(j=1;j<=n;j++)
  {
   if(i!=j)
    printf("n <%d,%d>=%d",i,j,p[i][j]);
  }
 getch();
}
Read more Similar C Programs
Data Structures

Learn C Programming

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

(c) www.c-program-example.com

C Program to sort a linked list.

Posted on by Sandeepa Nadahalli
Data structures using C, Linked list is a data structure in which the objects are arranged in a linear order. In this program, we sort the list elements in ascending order. Read more about C Programming Language .

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/




#include <stdio.h>
#include <stdlib.h>
#define NULL 0

struct linked_list
{
 int number;
 struct linked_list *next;
};
typedef struct linked_list node;

main ()
{
 int n;
 node *head = NULL;
 void print(node *p);
 node *insert_Sort(node *p, int n);

 printf("Input the list of numbers.n");
 printf("At end, type -999.n");
 scanf("%d",&n);

 while(n != -999)
 {
  if(head == NULL)       /* create 'base' node */
  {
   head = (node *)malloc(sizeof(node));
   head ->number = n;
   head->next = NULL;

  }

  else    /* insert next item */
  {
   head = insert_Sort(head,n);
  }
  scanf("%d", &n);
 }
 printf("n");
 print(head);
 print("n");
}
node *insert_Sort(node *list, int x)
{
 node *p1, *p2, *p;
 p1 = NULL;
 p2 = list; /* p2 points to first node */

 for( ; p2->number < x ; p2 = p2->next)
 {
  p1 = p2;

  if(p2->next == NULL)
  {
   p2 = p2->next;    /* p2 set to NULL */
   break;      /* insert new node at end */
  }
 }

 /* key node found */
 p = (node *)malloc(sizeof(node)); /* space for new node */
 p->number = x;     /* place value in the new node */
 p->next = p2;      /* link new node to key node */
 if (p1 == NULL)
  list = p;      /* new node becomes the first node */
 else
  p1->next = p;  /* new node inserted after 1st node */
 return (list);
}
void print(node *list)
{
 if (list == NULL)
  printf("NULL");
 else
 {
  printf("%d-->",list->number);
  print(list->next);
 }
 return;
}
Read more Similar C Programs
Data Structures

Learn C Programming

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

(c) www.c-program-example.com

C Program to implement HEAP sort

Posted on by Sandeepa Nadahalli
Data structures using C, Heap sort algorithm starts by building a heap from the given elements,and then heap removes its largest element from the end of partially sorted array. After removing the largest element, it reconstructs the heap, removes the largest remaining item, and places it in the next open position from the end of the partially sorted array. This is repeated until there are no items left in the heap and the sorted array is full. Elementary implementations require two arrays – one to hold the heap and the other to hold the sorted elements. Read more about C Programming Language . 

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                                  Happy Coding
***********************************************************/

#include<stdio.h>


void heapsort(int[],int);
void heapify(int[],int);
void adjust(int[],int);




main()
{
 int n,i,a[50];
 system("clear");

 printf("nEnter the limit:");
 scanf("%d",&n);

 printf("nEnter the elements:");
 for(i=0;i<n;i++)
  scanf("%d",&a[i]);

 heapsort(a,n);

 printf("nThe Sorted Elements Are:n");
 for(i=0;i<n;i++)
  printf("t%d",a[i]);
 printf("n"); 
}

void heapsort(int a[],int n)
{
 int i,t;

 heapify(a,n);

 for(i=n-1;i>0;i--)
 {
  t = a[0];
  a[0] = a[i];
  a[i] = t;
  adjust(a,i);
 }
}


void heapify(int a[],int n)
{
 int k,i,j,item;

 for(k=1;k<n;k++)
 {
  item = a[k];
  i = k;
  j = (i-1)/2;

  while((i>0)&&(item>a[j]))
  {
   a[i] = a[j];
   i = j;
   j = (i-1)/2;
  }
  a[i] = item;
 }
}

void adjust(int a[],int n)
{
 int i,j,item;

 j = 0;
 item = a[j];
 i = 2*j+1;

 while(i<=n-1)
 {
  if(i+1 <= n-1)
   if(a[i] <a[i+1])
    i++;
  if(item<a[i])
  {
   a[j] = a[i];
   j = i;
   i = 2*j+1;
  }
  else
   break;
 }
 a[j] = item;
}

Read more Similar C Programs
Data Structures
C Sorting Techniques
You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

(c) www.c-program-example.com