Tower of Hanoi – C Program
Tower of Hanoi C Program It is basically a mathematical puzzle game. Suppose there are 3 sticks A,B & C and suppose on stick A, there are finite number (n) of disks with decreasing...
Author: Sounak Roy
Addition Of Two Complex Numbers
Complex Number: A complex number is a number that can be expressed in the form a + bi, where a and b are real numbers, and i is a solution of the equation x2 = −1. Because no real number satisfies this...
Addition of Polynomial Equations Using Linked List
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 |
#include<stdio.h> #include<conio.h> #include<stdlib.h> typedef struct link { int coef,exp; struct link *next; }node; void create(node *temp) { char ch; printf("\nenter the coef and exp"); scanf("%d%d",&temp->coef,&temp->exp); temp->next=NULL; printf("\ndo you want another?"); fflush(stdin); ch=getchar(); if(ch!='y') return; else { temp->next=(node*)malloc(sizeof(node)); create(temp->next); } } void show(node *temp) { if(temp->next==NULL) printf("%4d%4d",temp->coef,temp->exp); else { printf("%4d%4d",temp->coef,temp->exp); show(temp->next); } } void attach(int c,int e,node *y) { y->coef=c; y->exp=e; } node *add(node *a,node *b) { node *p,*q,*c,*d,*temp; int x; p=a; q=b; c=(node*)malloc(sizeof(node)); d=c; while((p!=NULL)&&(q!=NULL)) { if(p->exp==q->exp) { x=p->coef+q->coef; if(x!=0) { attach(x,p->exp,d); p=p->next; q=q->next; temp=d; d->next=(node*)malloc(sizeof(node)); d=d->next; } } else if(p->exp<q->exp) { attach(q->coef,q->exp,d); q=q->next; temp=d; d->next=(node*)malloc(sizeof(node)); d=d->next; } else { attach(p->coef,p->exp,d); p=p->next; temp=d; d->next=(node*)malloc(sizeof(node)); d=d->next; } } while(p!=NULL) { attach(p->coef,p->exp,d); p=p->next; temp=d; d->next=(node*)malloc(sizeof(node)); d=d->next; } while(q!=NULL) { attach(q->coef,q->exp,d); q=q->next; temp=d; d->next=(node*)malloc(sizeof(node)); d=d->next; } temp->next=NULL; return(c); } void main() { node *head1,*head2,*result; clrscr(); head1=(node*)malloc(sizeof(node)); printf("\nenter the 1st polynomial"); create(head1); head2=(node*)malloc(sizeof(node)); printf("\nenter the 2nd polynomial"); create(head2); result=add(head1,head2); printf("\nshowing the result"); show(result); getch(); } |
All 4 Digit Tech Numbers Using C Language
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 |
#include<iostream.h> #include<conio.h> int sum(int n) { int r,s,c; c=n/100; r=n%100; s=(r+c); return(s*s); } void main() { int i,n; clrscr(); cout<<"\nall 4 digit tech number are as follows"; for(i=1000;i<=9999;i++) { n=sum(i); if(i==n) cout<<endl<<i; } getch(); } |
Create & Display a Single Linked List
Linked List Linked list is a data structure for storing and collecting data. In the link list, each node contains two part that is data and address of next node. C Program To Create & Display Single...
Write a C Program To Reverse a Single Linked List
C program to reverse a Linked List.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 |
#include<stdio.h> #include<conio.h> #include<stdlib.h> typedef struct link { int info; struct link *next; }node; node* rev(node *temp) { node *end,*e1; end=NULL; while(temp!=NULL) { e1=temp->next; temp->next=end; end=temp; temp=e1; } return(end); } void main() { void create(node*); void show(node*); node *head; clrscr(); printf("\ncreate the link list"); head=(node*)malloc(sizeof(node)); create(head); printf("\nshowing the list"); show(head); printf("\nFast node insert"); head=rev(head); show(head); getch(); } void create(node *temp) { char ans; printf("\nenter the info"); scanf("%d",&temp->info); temp->next=NULL; printf("\ndo you want more?"); fflush(stdin); ans=getchar(); if(ans!='y') return; else { temp->next=(node*)malloc(sizeof(node)); create(temp->next); } } void show(node *temp) { if(temp->next==NULL) printf("%4d",temp->info); else { printf("%4d",temp->info); show(temp->next); } } |
Linear Queue Implementation
This a simple program of Linear Queue implementation. Here queue[] is an array, “size” is the length of the array. “item” is an integer type variable which is used to take the inputs/data elements...
Hello World In C For Beginners
This program can be compiled using Turbo C compiler, this compiler need two header files that is stdio.h and conio.h but if you want to compile the same program in GCC compiler in Linux...
How to Install Linux OS? | Step-By-Step-2018
Linux Operating System Getting bored of window OS, and its cons like slow down laptop, crash OS several times, so you must try the Linux Operating System. Install Linux is not a big deal you...
Top 3 Specs. of OPPO Find X You Must Know
Smartphones are getting improved day by day, people’s expectation from their smartphone is increasing, as a result, the brand giving their best to garb buyers. In the year of 2018, the maximum smartphones coming...