implementation of myatoi function in c.
Atoi function converts a string numeric value into integer value.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 |
/* Code by Codingstreet.com */ #include<stdio.h> int myatoi(const char *str){ int val=0; while(*str!='\0'){ val=val*10+(*str)-'0'; str++; } return val; } int main(){ printf("%d",myatoi("2003")); return 0; } |
C program to reverse words in place in a string:
Approach :
Step1: Reverse the whole string
Step2: Reverse the characters in words
e.g.
Before Rev Old: [I am a good coder]
After Rev: [redoc doog a ma I]
New: [coder good a am I]
|
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 |
#include<stdio.h> #include<string.h> void strrev(char *str,int s,int e){ int i,j=e; char c; for(i=s;i<=j;i++){ c=str[j]; str[j]=str[i]; str[i]=c; j--; } } int main(){ char s[]="I am a good coder"; printf("Before Rev Old: [%s] ",s); strrev(s,0,strlen(s)-1); printf("After Rev: [%s] ",s); int i,j; for(i=0;i<strlen(s)-1;i++){ for(j=i;j<strlen(s)-1;j++) { if(s[j]==' ') { strrev(s,i,j-1); break;} } if(s[j+1]=='\0') strrev(s,i,j); i=j; } printf("New: [%s] ",s); return 0; } |
As we all know there is memory limitation in C. If we want to store number which is more than of 4 byte we cannot use int data type. We can use long data type to store value which is upto 8 byte. What after that?. If our value is of more than 8 bytes then we have to implement our own method to store value.
Here is the implementation of calculating factorial for large numbers like 100!
Explanation:
This program works on basic method of multiplication of a two numbers.
1234
X 15
Ans: 18510
Steps are:
Step Digit Carry
15*4 = 60; 0 6
(15*3)+6=51 1 5
(15*2)+5=35 5 3
(15*1)+3=18 8 1
After this carry digits are extracted and stored in array. ( if our carry was 25 then we must extract 2 and 5 then store it in array )
So output is: 18510
In program:
Array of 200 lengths is taken to store digits of multiplication result.
Index variable indicates the length of output..
tmp is used to store carry value;
————————————————————————————————————————–
Calculating Factorial of large numbers in c
Her we have taken array size of 200 so we can calculate factorial of a number whose digits are 200. if you want to calculate for more than 200 just increase the size of array.
|
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 |
/* C code to implement factorial of large number */ #include<stdio.h> int main(){ int a[200],index,i,j,n,tmp,counter=0; printf("\n Enter the no : "); scanf("%d",&n); a[0]=1; index=0; //Calculation Loop for(j=n;j>=2;j--){ tmp=0; /* This Loop is used to multiply the numbers */ for(i=0;i<=index;i++){ tmp=(a[i]*j)+tmp; // here tmp is carry digir which should be added to next multiplied value a[i]=tmp%10; // Extracting last digit of number tmp=tmp/10; // Extracring carry digir } // This loop helps you to extract digits from last calculated carry digits /* Supposse last carry digit is 25 then we must extract each digit( 5 & 2) and store it into array */ while(tmp>0){ a[++index]=tmp%10; tmp=tmp/10; } } //Loop to print output of calculated factorial printf("\n The factorial of %d is : \n",n); for(i=index;i>=0;i--) printf("%d",a[i]); return 0; } |
C function to mirror binary tree.
C Function implementation :
|
1 2 3 4 5 6 7 8 9 10 11 |
/* C Function to Mirror Binary Tree */ void mirrorbst(struct Tnode *Troot){ struct Tnode *tmp; if(Troot==NULL) return; mirrorbst(Troot->left); mirrorbst(Troot->right); tmp=Troot->left; Troot->left=Troot->right; Troot->right=tmp; } |
Complete C Code implementation
|
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 |
/* Binary Search tree code by condingstreet.com */ #include<stdio.h> #include<stdlib.h> struct Tnode { int val; struct Tnode *left,*right; }; int create_node(int val,struct Tnode **node){ struct Tnode *tmp; tmp=malloc(sizeof(struct Tnode)); if(tmp==NULL) return 0; tmp->val=val; tmp->left=NULL; tmp->right=NULL; (*node)=tmp; return 1; } void insert_node(struct Tnode **Troot,struct Tnode **node){ struct Tnode *parent,*tmp; int val; if((*node)==NULL) return; if((*Troot)==NULL){ (*Troot)=(*node); return; } tmp=(*Troot); val=(*node)->val; while(tmp!=NULL){ parent=tmp; if(val<tmp->val) tmp=tmp->left; else tmp=tmp->right; } if(val<parent->val){ parent->left=(*node); } else parent->right=(*node); return; } void inorder(struct Tnode *node){ if(node!=NULL){ inorder(node->left); printf(" %d ",node->val); inorder(node->right); } } /* C Function to Mirror Binary Tree */ void mirrorbst(struct Tnode *Troot){ struct Tnode *tmp; if(Troot==NULL) return; mirrorbst(Troot->left); mirrorbst(Troot->right); tmp=Troot->left; Troot->left=Troot->right; Troot->right=tmp; } int main(){ struct Tnode *root=NULL,*node; int key,ival; do{ printf("\n[1] Insert value"); printf("\n[2] Print inorder "); printf("\n[3] Mirror Bst "); printf("\n[4] Exit"); printf("\nEnter the input key : "); scanf("%d",&key); switch(key){ case 1: printf("\n Enter the value to be inserted :"); scanf("%d",&ival); if(create_node(ival,&node)) insert_node(&root,&node); else printf("\n Memory is Full !! "); break; case 2: inorder(root); break; case 3: mirrorbst(root); break; case 4: break; default: printf("\t Enter the Correct key !!!!! "); break; } }while(key!=4); printf("\n Thank you for using codingstreet.com 's datastructure solution "); return 0; } |
Print Ancestor of given node value in binary tree.
For Given Binary Search tree find out the ancestor of a given node value .
Node Value O/P
4 8 3 6
13 8 10 14
Recursive function to print ancestor values for given binary search tree.
|
1 2 3 4 5 6 7 8 9 |
int printances(struct Tnode *Troot1,int nodeval){ if(Troot1==NULL) return 0; if(nodeval==Troot1->val) return 1; if(printances(Troot1->left,nodeval)||printances(Troot1->right,nodeval)) { printf(" %d ",Troot1->val); return 1; } return 0; } |
Complete code with binary search tree implementation and ancestor printing function.
|
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 |
/* Binary Search tree code by condingstreet.com */ #include<stdio.h> #include<stdlib.h> struct Tnode { int val; struct Tnode *left,*right; }; int create_node(int val,struct Tnode **node){ struct Tnode *tmp; tmp=malloc(sizeof(struct Tnode)); if(tmp==NULL) return 0; tmp->val=val; tmp->left=NULL; tmp->right=NULL; (*node)=tmp; return 1; } void insert_node(struct Tnode **Troot,struct Tnode **node){ struct Tnode *parent,*tmp; int val; if((*node)==NULL) return; if((*Troot)==NULL){ (*Troot)=(*node); return; } tmp=(*Troot); val=(*node)->val; while(tmp!=NULL){ parent=tmp; if(val<tmp->val) tmp=tmp->left; else tmp=tmp->right; } if(val<parent->val){ parent->left=(*node); } else parent->right=(*node); return; } int printances(struct Tnode *Troot1,int nodeval){ if(Troot1==NULL) return 0; if(nodeval==Troot1->val) return 1; if(printances(Troot1->left,nodeval)||printances(Troot1->right,nodeval)) printf(" %d ",Troot1->val); } int main(){ struct Tnode *root=NULL,*node; int key,ival; do{ printf("\n[1] Insert value"); printf("\n[2] Print Ancestors "); printf("\n[3] Exit "); printf("\nEnter the input key : "); scanf("%d",&key); switch(key){ case 1: printf("\n Enter the value to be inserted :"); scanf("%d",&ival); if(create_node(ival,&node)) insert_node(&root,&node); else printf("\n Memory is Full !! "); break; case 2: printf("\n Enter the value whose ancestore to be calculated :"); scanf("%d",&ival); printances(root,ival); break; case 3: break; default: printf("\t Enter the Correct key !!!!! "); break; } }while(key!=3); printf("\n Thank you for using codingstreet.com 's datastructure solution "); return 0; } |
C code to perform operation on array and basic input output of int, float, char, string in c.
| Basic I/O | Array Operation |
| Integer input | Array input |
| Float input | Array Sorting |
| Char input | >Basic Method |
| String input | >Bubble Sort |
| >Insertion Sort | |
| >Quick Sort | |
| >Heap Sort |
Star pattern printing using C code. :
C code examples to pattern printing using stars and string function implementation to perform string manipulations.
Star printing patterns in C. String function implementation.
C Code Examples to play with numbers.
| Find a perfect number | Print Pascal Triangle |
| Find a factorial of a number | Fibonacci series |
C code to print specific level values in BST. Level 0 mean Root value.
For above binary tree
Level Values
0 8
1 3 10
2 1 6 14
….
Function implementation for level printing :
|
1 2 3 4 5 6 7 8 |
void levelprinting(struct Tnode **Troot,int level,int inlev){ if((*Troot)!=NULL){ levelprinting(&((*Troot)->left),level+1,inlev); if(level==inlev) printf("%d ",(*Troot)->val); levelprinting(&((*Troot)->right),level+1,inlev); } } |
Complete C code with implementation of binary tree and level printing in BST.
|
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 |
/* Binary Search tree code by condingstreet.com */ #include<stdio.h> #include<stdlib.h> struct Tnode { int val; struct Tnode *left,*right; }; int create_node(int val,struct Tnode **node){ struct Tnode *tmp; tmp=malloc(sizeof(struct Tnode)); if(tmp==NULL) return 0; tmp->val=val; tmp->left=NULL; tmp->right=NULL; (*node)=tmp; return 1; } void insert_node(struct Tnode **Troot,struct Tnode **node){ struct Tnode *parent,*tmp; int val; if((*node)==NULL) return; if((*Troot)==NULL){ (*Troot)=(*node); return; } tmp=(*Troot); val=(*node)->val; while(tmp!=NULL){ parent=tmp; if(val<tmp->val) tmp=tmp->left; else tmp=tmp->right; } if(val<parent->val){ parent->left=(*node); } else parent->right=(*node); return; } void preorder(struct Tnode **Troot){ if((*Troot)!=NULL){ printf(" %d ",(*Troot)->val); preorder(&((*Troot)->left)); preorder(&((*Troot)->right)); } } void postorder(struct Tnode **Troot){ if((*Troot)!=NULL){ postorder(&((*Troot)->left)); postorder(&((*Troot)->right)); printf(" %d ",(*Troot)->val); } } void inorder(struct Tnode **Troot){ if((*Troot)!=NULL){ inorder(&((*Troot)->left)); printf(" %d ",(*Troot)->val); inorder(&((*Troot)->right)); } } void levelprinting(struct Tnode **Troot,int level,int inlev){ if((*Troot)!=NULL){ levelprinting(&((*Troot)->left),level+1,inlev); if(level==inlev) printf("%d ",(*Troot)->val); levelprinting(&((*Troot)->right),level+1,inlev); } } int main(){ struct Tnode *root=NULL,*node; int key,ival; do{ printf("\n[1] Insert value"); printf("\n[2] Print Tree (Preorder) "); printf("\n[3] Print Tree (inorder) "); printf("\n[4] Print Tree (postorder) "); printf("\n[5] Level printing "); printf("\n[6] Exit "); printf("\nEnter the input key : "); scanf("%d",&key); switch(key){ case 1: printf("\n Enter the value to be inserted :"); scanf("%d",&ival); if(create_node(ival,&node)) insert_node(&root,&node); else printf("\n Memory is Full !! "); break; case 2: printf("\n Tree contents are :\n"); preorder(&root); break; case 3: printf("\n Tree contents are :\n"); inorder(&root); break; case 4: printf("\n Tree contents are :\n"); postorder(&root); break; case 5: printf("\n Enter the level :"); scanf("%d",&ival); levelprinting(&root,0,ival); break; case 6: break; default: printf("\t Enter the Correct key !!!!! "); break; } }while(key!=5); printf("\n Thank you for using codingstreet.com 's datastructure solution "); return 0; } |
Binary Tree implementation code with print all paths in Binary tree Code in C.
|
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 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 |
/* Binary Search tree code by condingstreet.com */ #include<stdio.h> #include<stdlib.h> struct Tnode { int val; struct Tnode *left,*right; }; struct snode{ struct Tnode *node; struct snode *next; }; int create_node(int val,struct Tnode **node){ struct Tnode *tmp; tmp=malloc(sizeof(struct Tnode)); if(tmp==NULL) return 0; tmp->val=val; tmp->left=NULL; tmp->right=NULL; (*node)=tmp; return 1; } void insert_node(struct Tnode **Troot,struct Tnode **node){ struct Tnode *parent,*tmp; int val; if((*node)==NULL) return; if((*Troot)==NULL){ (*Troot)=(*node); return; } tmp=(*Troot); val=(*node)->val; while(tmp!=NULL){ parent=tmp; if(val<tmp->val) tmp=tmp->left; else tmp=tmp->right; } if(val<parent->val){ parent->left=(*node); } else parent->right=(*node); return; } void push_sstack(struct snode **stack,struct Tnode *node){ struct snode *stop,*tmp; stop=*stack; if(stop==NULL){ tmp=malloc(sizeof(struct snode)); tmp->node=node; tmp->next=NULL; (*stack)=tmp; } else { tmp=malloc(sizeof(struct snode)); if(tmp!=NULL){ tmp->node=node; tmp->next=stop; (*stack)=tmp;} else printf(" \n Memory is Full Can't insert value\n "); } } struct Tnode *pop_sstack(struct snode **stack){ if((*stack)!=NULL) { struct Tnode *rval; struct snode *tmp,*stop; stop=(*stack); tmp=stop; rval=tmp->node; stop=stop->next; *stack=stop; tmp->next=NULL; free(tmp); return rval; } return NULL; } int is_stack_empty(struct snode **stack){ if((*stack)==NULL) return 1; else return 0; } void printpaths(struct Tnode *root){ int path[800]; printpathrec(root,path,0); } void printarray(int path[],int pathlen){ int i; for(i=0;i<pathlen;i++) printf(" %d ",path[i]); printf("\n"); } void printpathrec(struct Tnode *root, int path[],int pathlen){ if(root==NULL) return; path[pathlen]=root->val; pathlen++; if(root->left==NULL && root->right==NULL){ printarray(path,pathlen); } else { printpathrec(root->left,path,pathlen); printpathrec(root->right,path,pathlen); } } void inorder_iterative(struct Tnode **Troot ) { if((*Troot)==NULL) return; struct snode *s1; struct Tnode *curnode=(*Troot); while(!is_stack_empty(&s1) || curnode!=NULL) { if(curnode!=NULL) { push_sstack(&s1,curnode); curnode=curnode->left; } else { curnode=pop_sstack(&s1); printf(" %d ",curnode->val); curnode=curnode->right; } } } int main(){ struct Tnode *root=NULL,*node; int key,ival,*sum,ssum=0; sum=&ssum; do{ printf("\n[1] Insert value"); printf("\n[2] Print Tree (inorder) "); printf("\n[3] Print paths"); printf("\n[4] Exit "); printf("\nEnter the input key : "); scanf("%d",&key); switch(key){ case 1: printf("\n Enter the value to be inserted :"); scanf("%d",&ival); if(create_node(ival,&node)) insert_node(&root,&node); else printf("\n Memory is Full !! "); break; case 2: printf("\n Tree contents are :\n"); inorder_iterative(&root); break; case 3: printpaths(root); break; case 4: break; default: printf("\t Enter the Correct key !!!!! "); break; } }while(key!=4); printf("\n Thank you for using codingstreet.com 's datastructure solution "); return 0; } |
C function to print all paths in binary tree from root to leaf.
For a given binary tree o/p should be :
Print all paths o/p :
8 3 1
8 3 6 4
8 3 6 7
8 10 14 13
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 |
void printpaths(struct Tnode *root){ int path[800]; printpathrec(root,path,0); } void printarray(int path[],int pathlen){ int i; for(i=0;i<pathlen;i++) printf(" %d ",path[i]); printf("\n"); } void printpathrec(struct Tnode *root, int path[],int pathlen){ if(root==NULL) return; path[pathlen]=root->val; pathlen++; if(root->left==NULL && root->right==NULL){ printarray(path,pathlen); } else { printpathrec(root->left,path,pathlen); printpathrec(root->right,path,pathlen); } } |
==> Click Here to Get Complete C Code of Binary Search Tree implementation
==> Click here to Get Code for all Path Print and Binary Tree implementation
References : http://cslibrary.stanford.edu/110/BinaryTrees.html
