C language programs

8/3/2019 C language programs

1/144

October 29, 2011 [C LANGUAGE PROGRAMS BY MR.K-MANIKANTA] For More @ www.stylewap.in

Manikanta Page 1M.C.A

Calculate Electricity Bill with if-else conditionCalculate Electricity Bill with if-else condition 100 and 300 and 500 Rs.5/units

#include#includevoid main (){int unit, total;clrscr ();printf("Enter Total Units:");scanf ("%d",&unit);if(unit100&& unit300&& unit


2/144



if(units


3/144



{int number;struct node *next;};

struct node *head = NULL;

/* insert a node directly at the right place in the linked list*/void insert_node(int value);

int main(void){struct node *current = NULL;struct node *next = NULL;int test[] = {8, 3, 2, 6, 1, 5, 4, 7, 9, 0};int i = 0;

/* insert some numbers into the linked list */for(i = 0; i < i =" 0;">next != NULL){printf("%4d\t%4d\n", test[i++], head->number);head = head->next;}

/* free the list */for(current = head; current != NULL; current = next)next = current->next, free(current);

return 0;}

void insert_node(int value){struct node *temp = NULL;struct node *one = NULL;struct node *two = NULL;

if(head == NULL) {

head = (struct node *)malloc(sizeof(struct node *));head->next = NULL;}

one = head;two = head->next;

temp = (struct node *)malloc(sizeof(struct node *));


4/144



temp->number = value;

while(two != NULL && temp->number number) {one = one->next;two = two->next;

}

one->next = temp;temp->next = two;}A bubblesort routine# include# includevoid bubblesort(int array[],int size);void main(){int values[10],j;for(j=0;j


5/144



scanf("%d",&number1);printf("Enter the number2 number to compare.\n");scanf("%d",&number2);printf("number1 > number2 has the value %d\n", number1 >number2);

printf("number1 < number2 has the value %d\n", number1


6/144



printf("Enter how many elements u want to add:");scanf("%d",&n);printf("Enter the elements:");for(i=0;i


7/144



{

for(j=0;j


8/144



}

else

printf(Addition of Matrix cannot be done);

getch();

}AREA OF CIRCLE#includevoid main (){float r,c;clrscr();printf ("Enter Radius: ");scanf ("%f",&r);c=3.14*r*r;printf ("\nArea is : %.2f",c);getch ();}

Output

ARRANGE THE ELEMENTS IN ARRAY IN DESSENDING ORDERmain(){int a[100],i,n,j,search,temp;printf("\n how many no's in array");scanf("%d",&n);printf("\n enter %d elements in array",n);for(i=0;i

scanf("%d",&a[i]);for(i=0;i{for(j=i+1;j{if(a[i]{temp=a[i];
http://free-c-programs.blogspot.com/2007/08/area-of-circle.htmlhttp://free-c-programs.blogspot.com/2008/12/arrange-elements-in-array-in-dessending.htmlhttp://bp0.blogger.com/_urRtV3T_f1g/RtPcIGrnSUI/AAAAAAAAABQ/6crpx1md1Sk/s1600-h/output.JPGhttp://free-c-programs.blogspot.com/2008/12/arrange-elements-in-array-in-dessending.htmlhttp://free-c-programs.blogspot.com/2007/08/area-of-circle.html


9/144



a[i]=a[j];a[j]=temp;}}printf("%4d",a[i]);

}getch();}ATM programingATM C programing language Program code

/*Note Pin code is 1234*/#include#include

void main(void){ unsigned long amount=1000,deposit,withdraw;int choice,pin=0,k=0;char another='y';

while(pin!=1234){ clrscr();gotoxy(30,25);printf("Enter pin:");scanf("%d",&pin);}clrscr();do

{

printf("********Welcome to ATM Service**************\n");printf("1. Check Balance\n");printf("2. Withdraw Cash\n");printf("3. Deposit Cash\n");printf("4. Quit\n");printf("*********************************************\n\n");printf("Enter your choice: ");scanf("%d",&choice);switch(choice)

{case 1:printf("\nYour Balance is Rs : %lu ",amount);break;case 2:printf("\nEnter the amount to withdraw: ");scanf("%lu",&withdraw);if(withdraw%100!=0)
http://free-c-programs.blogspot.com/2011/08/atm-programing.htmlhttp://free-c-programs.blogspot.com/2011/08/atm-programing.html


10/144



{printf("\nPlease enter

amount in multiples of 100");}else if(withdraw>(amount-500))

{

printf("\nInsufficient Funds");}else{

amount=amount-withdraw;

printf("\n\nPlease collect cash");

printf("\nYour balance is %lu",amount);}break;case 3:printf("\nEnter amount to deposit");scanf("%lu",&deposit);amount=amount+deposit;printf("Your balance is %lu",amount);break;case 4:printf("\nThank you for using ATM");break;default:

printf("\nInvalid Choice");}printf("\n\n\nDo you want another transaction?(y/n): ");fflush(stdin);scanf("%c",&another);if(another=='n'||another=='N')k=1;}while(!k);printf("\n\nHave a nice day");getch();

}Basic example showing constants usage in C#include/*constants for bonus rates and sales*/#define BONUSRATE1 0.1#define BONUSRATE2 0.15#define BONUSRATE3 0.2#define SALES1 2000
http://free-c-programs.blogspot.com/2008/12/basic-example-showing-constants-usage.htmlhttp://free-c-programs.blogspot.com/2008/12/basic-example-showing-constants-usage.html


11/144



#define SALES2 5000#define SALES3 10000int main(){int sales;

double commission;/*get employees sales*/printf("Please enter your total sales to the nearestdollar.\n");scanf("%d", &sales);/*calculate employees bonus based on info*/if(sales 2000 && sales


12/144



}printf("No. OF AVG STUDENTS ARE:%d\n",ae);printf("No. OF ABOVE AVERAGE STUDENTS:%d\n",aa);printf("No. OF BELOW AVERAGE STUDENTS ARE:%d",ba);

getch();

}Binary search#define TRUE 0#define FALSE 1

int main(void){int array[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};int left = 0;int right = 10;int middle = 0;int number = 0;int bsearch = FALSE;int i = 0;

printf("ARRAY: ");for(i = 1; i


13/144



#define MAX 10

struct lnode{int data;

struct lnode *next;} *head, *visit;

/* add a new entry to the linked list */void llist_add(struct lnode **q, int num);/* preform a bubble sort on the linked list */void llist_bubble_sort(void);/* print the entire linked list */void llist_print(void);

int main(void) {/* linked list */struct lnode *newnode = NULL;int i = 0; /* a general counter */

/* load some random values into the linked list */for(i = 0; i < MAX; i++){llist_add(&newnode, (rand() % 100));}

head = newnode;printf("Before bubble sort:\n");

llist_print();printf("After bubble sort:\n");llist_bubble_sort();llist_print();

return 0;}

/* adds a node at the end of a linked list */void llist_add(struct lnode **q, int num){

struct lnode *tmp;

tmp = *q;

/* if the list is empty, create first node */if(*q == NULL) {*q = malloc(sizeof(struct lnode));tmp = *q;


14/144



} else {/* go to last node */while(tmp->next != NULL)tmp = tmp->next;

/* add node at the end */tmp->next = malloc(sizeof(struct lnode));tmp = tmp->next;}

/* assign data to the last node */tmp->data = num;tmp->next = NULL;}

/* print the entire linked list */void llist_print(void){visit = head;

while(visit != NULL){printf("%d ", visit->data);visit = visit->next;}printf("\n");}

/* preform a bubble sort on the linked list */void llist_bubble_sort(void) {struct lnode *a = NULL;struct lnode *b = NULL;struct lnode *c = NULL;struct lnode *e = NULL;struct lnode *tmp = NULL;

/*// the `c' node precedes the `a' and `e' node// pointing up the node to which the comparisons

// are being made.*/while(e != head->next){c = a = head;b = a->next;while(a != e){


15/144



if(a->data > b->data){if(a == head){tmp = b -> next;

b->next = a;a->next = tmp;head = b;c = b;} else {tmp = b->next;b->next = a;a->next = tmp;c->next = b;c = b;}} else{c = a;a = a->next;}b = a->next;if(b == e)e = a;}}}bubble sort

#include

void bubble_sort(int a[], int size);

int main(void) {int arr[10] = {10, 2, 4, 1, 6, 5, 8, 7, 3, 9};int i = 0;

printf("before:\n");for(i = 0; i < 10; i++) printf("%d ", arr[i]);

printf("\n");

bubble_sort(arr, 10);

printf("after:\n");for(i = 0; i < 10; i++) printf("%d ", arr[i]);printf("\n");
http://free-c-programs.blogspot.com/2008/12/bubble-sort.htmlhttp://free-c-programs.blogspot.com/2008/12/bubble-sort.html


16/144



return 0;}

void bubble_sort(int a[], int size){

int switched = 1;int hold = 0;int i = 0;int j = 0;

size -= 1;

for(i = 0; i < size && switched; i++){switched = 0;for(j = 0; j < size - i; j++)if(a[j] > a[j+1]){switched = 1;hold = a[j];a[j] = a[j + 1];a[j + 1] = hold;}}}Bubble sort in string array#include #include

#include

#define MAX 50#define N 2000

void sort_words(char *x[], int y);void swap(char **, char **);

int main(void){

char word[MAX];char *x[N];int n = 0;int i = 0;

for(i = 0; scanf("%s", word) == 1; ++i){if(i >= N)
http://free-c-programs.blogspot.com/2008/12/bubble-sort-in-string-array.htmlhttp://free-c-programs.blogspot.com/2008/12/bubble-sort-in-string-array.html


17/144



printf("Limit reached: %d\n", N), exit(1);

x[i] = calloc(strlen(word)+1, sizeof(char));strcpy(x[i], word);}

n = i;sort_words(x, n);for(i = 0; i < n; ++i)printf("%s\n", x[i]);

return(0);}

void sort_words(char *x[], int y){int i = 0;int j = 0;

for(i = 0; i < y; ++i)for(j = i + 1; j < y; ++j)if(strcmp(x[i], x[j]) > 0)swap(&x[i], &x[j]);}

void swap(char **p, char **q){char *tmp;

tmp = *p;*p = *q;*q = tmp;}C Program find Positive Negative with Switch Case WithoutConditional Operator#include#includevoid main(void){

char num;clrscr();printf("Enter a number +ve or -ve : ");scanf("%c",&num);switch(num){case '-':printf("Negative number");
http://free-c-programs.blogspot.com/2011/08/c-program-find-positive-negative-with.htmlhttp://free-c-programs.blogspot.com/2011/08/c-program-find-positive-negative-with.htmlhttp://free-c-programs.blogspot.com/2011/08/c-program-find-positive-negative-with.htmlhttp://free-c-programs.blogspot.com/2011/08/c-program-find-positive-negative-with.html


18/144



break;default:printf("Positive number");}getch();

}

C Program to calcuate interest and total amount at the end ofeach yearWrite ac programcalculate interest and total amount at da end of each year

Note: Output is not in the form of table and rate is taken as2%. It calculates amount of each year

#include #include void main(){int t=1;int r=2;int y;int y1=0;long int p,a;float i1;

double total;;clrscr();printf("enter starting amount&year");scanf("%ld""%d",&p,&y);while(y1

calculate the power in watts#includeint main()

{float power,voltage,current;voltage = current = 0;

printf("Power calculator.\n");printf("This will calculate the power in watts , ");printf("when you input the voltage and current.");/*get the voltage*/
http://free-c-programs.blogspot.com/2009/02/write-program-to-calculate-interest-and.htmlhttp://free-c-programs.blogspot.com/2009/02/write-program-to-calculate-interest-and.htmlhttp://free-c-programs.blogspot.com/2008/12/calculate-power-in-watts.htmlhttp://free-c-programs.blogspot.com/2008/12/calculate-power-in-watts.htmlhttp://free-c-programs.blogspot.com/2009/02/write-program-to-calculate-interest-and.htmlhttp://free-c-programs.blogspot.com/2009/02/write-program-to-calculate-interest-and.html


19/144



printf("Enter the voltage in volts.\n");scanf("%f",&voltage);/*get the current*/printf("Enter the current in amps.\n");scanf("%f",t);

/*calculate the power*/power = voltage * current;printf("The power in watts is %.2f watts\n",power);

return 0;}Concatenate Two Strings#include#include#includevoid main(){char c[100];char a[50];char b[50];clrscr();printf("Enter a string1:");gets(a);printf("Enter a string2:");gets(b);strcat( a,b);printf("%s",a);getch();

}Count no. of students above,below and average students#include#includevoid main(){int a[10];int aa=0,ba=0,ae=0,i;clrscr();printf("Enter the marks:\n");for(i=0;i55)aa++;else if(a[i]


20/144



}printf("No. OF AVG STUDENTS ARE:%d\n",ae);printf("No. OF ABOVE AVERAGE STUDENTS:%d\n",aa);printf("No. OF BELOW AVERAGE STUDENTS ARE:%d",ba);

getch();

}count occurrences of values in an array#includevoid print_arr(int grades[], int elements);int count_passes(int grades[], int elements,int value);

int main(void){int grades[10] = {70,80,95,65,35,85,54,78,45,68};int result;print_arr(grades,10);result = count_passes(grades,10,70);if(result == 1)printf("There was %d pass.\n",result);elseprintf("There were %d passes.\n",result);return 0;}

void print_arr(int grades[], int elements){int i;

for(i = 0;i < elements;i++){printf("%d ",grades[i]);}printf("\n");}

int count_passes(int grades[], int elements,int value){int i ,passes = 0 ;for(i = 0;i < elements;i++)

{if(grades[i] >= value)passes++;}return(passes);}count the array elements#include
http://free-c-programs.blogspot.com/2008/12/count-occurrences-of-values-in-array.htmlhttp://free-c-programs.blogspot.com/2011/08/count-array-elements.htmlhttp://free-c-programs.blogspot.com/2011/08/count-array-elements.htmlhttp://free-c-programs.blogspot.com/2008/12/count-occurrences-of-values-in-array.html


21/144



#includevoid main(){int a[10],i,c=0;clrscr();

printf("enter array elements=");for(i=0;i


22/144



printf("### After ###\n");for(i = 0; i < strcount; i++)printf("%2d: %s", i, strarray[i]);

/* free mem... */

for(i = 0; i < strcount; i++)free(strarray[i]);

free(strarray);return 0;}

static int cmpr(const void *a, const void *b){return strcmp(*(char **)a, *(char **)b);}

void sortstrarr(void *array, unsigned n){qsort(array, n, sizeof(char *), cmpr);}Example of Using Strings in C# include# include# include

void main(){

char *a;printf("Enter your name=");gets(a);printf("%s",a);getch();}Factorial Function In C#include "stdio.h"#include "conio.h"long int factorial(int n);void main()

{int n,i;float s,r;char c;clrscr();repeat : printf("You have this series:- 1/1! + 2/2! + 3/3! +4/4!");printf("To which term you want its sum? ");
http://free-c-programs.blogspot.com/2011/08/example-of-using-strings-in-c.htmlhttp://free-c-programs.blogspot.com/2008/12/factorial-function-in-c.htmlhttp://free-c-programs.blogspot.com/2008/12/factorial-function-in-c.htmlhttp://free-c-programs.blogspot.com/2011/08/example-of-using-strings-in-c.html


23/144



scanf("%d",&n);s=0;for (i=1;i


24/144


25/144



clrscr();printf("Enter a char:");scanf("%c",ch);printf("Enter a string:");scanf("%s",s);

printf("Enter a integer:");scanf("%d",&i);chp=&ch;sp=s;ip=&i;printf("\nchar\tadd\tstring\t\tstringadd\tint\tint add\n");printf("%c\t%u\t%s\t\t%u\t\t%d\t%u",ch,&chp,s,&s,i,&i);printf("\nchar pointer value is:%u",chp);printf("\nstring pointer value is:%u",sp);printf("\nint pointer value is:%u",ip);getch();}

Find Inverse of a Given Matrix#include#include#include#include

//Read Matrixvoid read_mat(float a[][10],int n){

int i,j;

printf("\n\nEnter %d X %d matrix below:\n",n,n);for(i=0;i


26/144



//Swap Rowsvoid swap_rows(float a[][10],int n,int i,int j){int k,temp;for(k=0;k


27/144



{row_sub(ia,n,i,j,a[j][i]);row_sub(a,n,i,j,a[j][i]);}}

}

//main functionvoid main(){float a[10][10],b[10][10];int n;clrscr();

//Accept Matrixprintf("\n\nEnter order of the square matrix \n");scanf("%d",&n);read_mat(a,n);

//inverse the matrixinverse(a,b,n);printf("\n \nInverse of the given square matrix is : \n");write_mat(b,n);getch();}FIND THE SUM OF DIGIT THREE Numbers/* FIND THE SUM OF DIGIT THREE NO'S*/#include "math.h"

main(){int d,d1,d2,d3,r1,r2,sum;clrscr();printf("\n enter any three digit no's");scanf("%d",&d);d1=d/100;r1=d%100;if(r1!=0){d2=r1/10;

r2=r1%10;if(r2!=0)d3=r2;elsed3=0;}elsed2=0;
http://free-c-programs.blogspot.com/2008/12/find-sum-of-digit-three-numbers.htmlhttp://free-c-programs.blogspot.com/2008/12/find-sum-of-digit-three-numbers.html


28/144



d3=0;}sum=d1+d2+d3;printf("\n sum of 3 digit no is %d",sum);getch();

}Hsort, heap sort/* array of MAXARRAY length ... */#define MAXARRAY 5

/* preform the heapsort */void heapsort(int ar[], int len);/* help heapsort() to bubble down starting at pos[ition] */void heapbubble(int pos, int ar[], int len);

int main(void) {int array[MAXARRAY];int i = 0;

/* load some random values into the array */for(i = 0; i < MAXARRAY; i++)array[i] = rand() % 100;

/* print the original array */printf("Before heapsort: ");for(i = 0; i < MAXARRAY; i++){printf(" %d ", array[i]);

}printf("\n");

heapsort(array, MAXARRAY);

/* print the `heapsorted' array */printf("After heapsort: ");for(i = 0; i < MAXARRAY; i++){printf(" %d ", array[i]);}

printf("\n");

return 0;}

void heapbubble(int pos, int array[], int len){int z = 0;
http://free-c-programs.blogspot.com/2008/12/hsort-heap-sort.htmlhttp://free-c-programs.blogspot.com/2008/12/hsort-heap-sort.html


29/144



int max = 0;int tmp = 0;int left = 0;int right = 0;

z = pos;for(;;) {left = 2 * z + 1;right = left + 1;

if(left >= len)return;else if(right >= len)max = left;else if(array[left] > array[right])max = left;elsemax = right;

if(array[z] > array[max])return;

tmp = array[z];array[z] = array[max];array[max] = tmp;z = max;}}

void heapsort(int array[], int len){int i = 0;int tmp = 0;

for(i = len / 2; i >= 0; --i)heapbubble(i, array, len);

for(i = len - 1; i > 0; i--){

tmp = array[0];array[0] = array[i];array[i] = tmp;heapbubble(0, array, i);}}Program for demonstration of Tree Operations - INSERTION,INORDER .
http://free-c-programs.blogspot.com/2008/12/program-for-demonstration-of-tree_14.htmlhttp://free-c-programs.blogspot.com/2008/12/program-for-demonstration-of-tree_14.htmlhttp://free-c-programs.blogspot.com/2008/12/program-for-demonstration-of-tree_14.htmlhttp://free-c-programs.blogspot.com/2008/12/program-for-demonstration-of-tree_14.html


30/144



#include #include # include

struct node

{struct node *left;int data;struct node *right;};

void main(){void insert(struct node **,int);void inorder(struct node *);void postorder(struct node *);void preorder(struct node *);struct node *ptr;int will,i,num;ptr = NULL;ptr->data=NULL;clrscr();

printf("Enter the number of terms you want to add to thetree.");scanf("%d",&will);

/* Getting Input */

for(i=0;i{printf("Enter the item");scanf("%d",&num);insert(&ptr,num);}

getch();printf("INORDER TRAVERSAL");inorder(ptr);getch();

printf("PREORDER TRAVERSAL");preorder(ptr);getch();printf("POSTORDER TRAVERSAL");postorder(ptr);getch();}


31/144


32/144


33/144



struct node *ptr;int will,i,num;ptr = NULL;ptr->data=NULL;clrscr();


/* Getting Input */for(i=0;i{printf("Enter the item");scanf("%d",&num);insert(&ptr,num);}

getch();printf("INORDER TRAVERSAL");inorder(ptr);getch();printf("PREORDER TRAVERSAL");preorder(ptr);getch();printf("POSTORDER TRAVERSAL");postorder(ptr);getch();

}

void insert(struct node **p,int num){

if((*p)==NULL){ printf("Leaf node created.");(*p)=malloc(sizeof(struct node));

(*p)->left = NULL;(*p)->right = NULL;(*p)->data = num;return;}else{ if(num==(*p)->data){


34/144



printf("REPEATED ENTRY ERRORVALUE REJECTED");return;}if(numdata)

{printf("Directed to left link.");insert(&((*p)->left),num);}else{printf("Directed to right link.");insert(&((*p)->right),num);}}return;}

void inorder(struct node *p){if(p!=NULL){inorder(p->left);printf("Data :%d",p->data);inorder(p->right);}

elsereturn;}

void preorder(struct node *p){if(p!=NULL){printf("Data :%d",p->data);preorder(p->left);

preorder(p->right);}elsereturn;}

void postorder(struct node *p)


35/144


36/144



int s, w;float sm;

for(s = 0; s < n - 1; s++){

w = fm(arr, s, n);sm = arr[w];arr[w] = arr[s];arr[s] = sm;}}Insertion sort in linked liststruct lnode {char *str;struct lnode *next;};

struct lnode *insert(char *data, struct lnode *list);void free_list(struct lnode *list);void print_list(struct lnode *list);

int main(void) {char line[1024];struct lnode *list;

list = NULL;while((fgets(line, 1024, stdin)) != NULL)list = insert(line, list);

print_list(list);free_list(list);return 0;}

struct lnode *insert(char *data, struct lnode *list) {struct lnode *p;struct lnode *q;

/* create a new node */

p = (struct lnode *)malloc(sizeof(struct lnode));/* save data into new node */p->str = strdup(data);

/* first, we handle the case where `data' should be the firstelement */if(list == NULL || strcmp(list->str, data) > 0) {/* apperently this !IS! the first element */
http://free-c-programs.blogspot.com/2008/12/insertion-sort-in-linked-list.htmlhttp://free-c-programs.blogspot.com/2008/12/insertion-sort-in-linked-list.html


37/144


38/144



chp=&ch;sp=s;ip=&i;printf("\nchar\tadd\tstring\t\tstringadd\tint\tint add\n");printf("%c\t%u\t%s\t\t%u\t\t%d\t%u",ch,&chp,s,&s,i,&i);

printf("\nchar pointer value is:%u",chp);printf("\nstring pointer value is:%u",sp);printf("\nint pointer value is:%u",ip);getch();}

Isort, insertion sort#include

void isort(float arr[], int n);int fm(float arr[], int b, int n);

int main(void){float arr1[5] = {4.3, 6.7, 2.8, 8.9, 1.0};float arr2[5] = {4.3, 6.7, 2.8, 8.9, 1.0};int i = 0;

isort(arr2, 5);

printf("\nBefore\tAfter\n--------------\n");

for(i = 0; i < 5; i++)

printf("%.2f\t%.2f\n", arr1[i], arr2[i]);

return 0;}

int fm(float arr[], int b, int n) {int f = b;int c;

for(c = b + 1; c < n; c++)if(arr[c] < arr[f])

f = c;

return f;}

void isort(float arr[], int n){int s, w;
http://free-c-programs.blogspot.com/2008/12/isort-insertion-sort.htmlhttp://free-c-programs.blogspot.com/2008/12/isort-insertion-sort.html


39/144



float sm;

for(s = 0; s < n - 1; s++){w = fm(arr, s, n);

sm = arr[w];arr[w] = arr[s];arr[s] = sm;}}UPPER, LOWER AND REVERSEvoid main (){char str [20];clrscr ();printf ("Enter your name: ");gets (str);printf("\nLength is : %d",strlen(str));printf("\nUpper is : %s",strupr(str));printf("\nLower is : %s",strlwr(str));printf("\nReverese is : %s",strrev(str));getch ();}

Linked List implementation#include"m_list.h"

void main(){list *first=NULL,*second=NULL,*third=NULL;int choice,i;char ch='y';while(1){clrscr();printf("case 1: Create list");
http://free-c-programs.blogspot.com/2007/08/upper-lower-and-reverse.htmlhttp://free-c-programs.blogspot.com/2008/12/linked-list-implementation.htmlhttp://bp1.blogger.com/_urRtV3T_f1g/RtQK7GrnS-I/AAAAAAAAAGg/DzbqUNmJsGo/s1600-h/output.JPGhttp://free-c-programs.blogspot.com/2008/12/linked-list-implementation.htmlhttp://free-c-programs.blogspot.com/2007/08/upper-lower-and-reverse.html


40/144



printf("case 2: Add in the list");printf("case 3: Delete in the list");printf("

case 4: Append two list");printf("case 5: show list");printf("case 6: Exit");printf("Enter your choice : ");scanf("%d",&choice);switch(choice){case 1: //create listwhile(ch!='n'){printf("Enter element : ");scanf("%d",&i);create(&first,i);printf("Enter element (y/n) : ");fflush(stdin);scanf("%c",&ch);}break;case 2: //add in the listint c;

clrscr();printf("case 1: Add in Beginning");printf("case 2: Add in End");printf("case 3: Add After a given element");printf("case 4: Return to main menu");printf("Enter your choice : ");scanf("%d",&c);switch(c){case 1: add_at_beg(&first);break;

case 2: add_at_end(&first);break;case 3: add_after_given_element(&first);break;case 4: break;}break;case 3:


41/144



clrscr();printf("case 1: Delete in Beginning");printf("case 2: Delete in End");printf("case 3: Delete a specified element");printf("case 4: Return to main menu");

printf("Enter your choice : ");scanf("%d",&c);switch(c){case 1: del_at_beg(&first);break;case 2: del_at_end(&first);break;case 3: del_specified_element(&first);break;case 4: break;}break;case 4:char ch='y';printf("Enter element in second list : ");while(ch!='n'){printf("Enter element : ");scanf("%d",&i);create(&second,i);printf("Enter element (y/n) : ");fflush(stdin);

scanf("%c",&ch);}append(&third,first,second);

break;case 5: //show listclrscr();printf("case 1: List 1");printf("case 2: List 2");

printf("case 3: List 3");printf("Enter choice : ");scanf("%d",&choice);switch(choice){case 1: show(first);break;


42/144


43/144


44/144



}else{temp=*l;*l=(*l)->next;

free(temp);}}void add_at_end(struct list **l){list *temp,*p;temp=(struct list *)malloc(sizeof(struct list));printf("Enter element : ");scanf("%d",&temp->info);temp->next=NULL;if(*l==NULL)*l=temp;else{p=*l;while(p->next!=NULL)p=p->next;p->next=temp;}}

void del_at_end(struct list **l)

{list *temp,*p;if(*l==NULL){printf("List is Empty");getch();}else if((*l)->next==NULL){temp=*l;

*l=NULL;free(temp);}else{p=*l;while(p->next->next!=NULL)p=p->next;


45/144



temp=p->next->next;p->next=NULL;free(temp);}}

void add_after_given_element(list **l){list *temp,*p;int m;temp=(struct list *)malloc(sizeof(struct list));printf("Enter element : ");scanf("%d",&temp->info);printf("Enter position after which element inserted : ");scanf("%d",&m);temp->next=NULL;if(*l==NULL)*l=temp;else{p=*l;while(p->next!=NULL)if(p->info==m)break;elsep=p->next;

temp->next=p->next;p->next=temp;

}}void del_specified_element(list **l){list *temp,*p,*q;int m;printf("Enter element which is deleted : ");

scanf("%d",&m);if(*l==NULL){printf("List is Empty");getch();}else if((*l)->next!=NULL && (*l)->info==m)


46/144



{temp=*l;*l=(*l)->next;free(temp);}

else if((*l)->next==NULL && (*l)->info==m){temp=*l;*l=NULL;free(temp);}else{p=*l;while(p!=NULL)if(p->info==m)break;else{q=p;p=p->next;}temp=p;q->next=p->next;free(temp);}}Matrix Multiplication

void main(){int row1=0,col1=1,row2=0,col2=0,**matrix1,**matrix2,**result;

clrscr();

printf(" Enter number of row for first matrix ");scanf("%d",&row1);

while (col1!=row2){printf(" Enter number of column for first matrix ");scanf("%d",&col1);
http://free-c-programs.blogspot.com/2008/12/matrix-multiplication.htmlhttp://free-c-programs.blogspot.com/2008/12/matrix-multiplication.html


47/144



printf(" Enter number of row for second matrix ");scanf("%d",&row2);

if (col1!=row2){

clrscr();printf("Column number of first matrix must be same as the rownumber of second matrix");}

}

printf(" Enter number of column for second matrix ");scanf("%d",&col2);

matrix1=init(matrix1,row1,col1);matrix2=init(matrix2,row2,col2);/* setting values in matrix */printf("First matrix \n");set(matrix1,row1,col1);printf("Second matrix \n");set(matrix2,row2,col2);/* printint matrix */clrscr();printf(" [ First matrix ]\n");get(matrix1,row1,col1);

printf(" [ Second matrix ]\n");get(matrix2,row2,col2);

printf(" [ Multiplication Result ]\n");result=mul(matrix1,matrix2,row1,col2,col1);get(result,row1,col2);printf("\n\t\t Thanks from debmalya jash");getch();free(matrix1);free(matrix2);fress(result);

} /* end main */

/* to initialize matrix */int** init(int** arr,int row,int col){


48/144



int i=0,j=0;

arr=(int**)malloc(sizeof(int)*row*col);

for(i=0;i{for(j=0;j{*((arr+i)+j)=(int*)malloc(sizeof(int));*(*(arr+i)+j)=0;}}return arr;}

/* to set value in matrix */int** set(int** arr,int row,int col){int i=0,j=0,val=0;

for(i=0;i{for(j=0;j{printf("Enter value for row %d col %d :",(i+1),(j+1));

scanf("%d",&val);*(*(arr+i)+j)=val;}}return arr;}

/* print values of the passed matrix */void get(int** arr,int row,int col){

int i=0,j=0;

for(i=0;i{for(j=0;j{printf("%d\t",*(*(arr+i)+j));


49/144


50/144



int main(void) {struct node *head;struct node *current;struct node *next;int test[] = {8, 3, 2, 6, 1, 5, 4, 7, 9, 0};

int i;

head = NULL;/* insert some numbers into the linked list */for(i = 0; i < 10; i++)head = addnode(test[i], head);

/* sort the list */head = mergesort(head);

/* print the list */printf(" before after\n"), i = 0;for(current = head; current != NULL; current = current->next)printf("%4d\t%4d\n", test[i++], current->number);

/* free the list */for(current = head; current != NULL; current = next)next = current->next, free(current);

/* done... */return 0;}

/* add a node to the linked list */struct node *addnode(int number, struct node *next) {struct node *tnode;

tnode = (struct node*)malloc(sizeof(*tnode));

if(tnode != NULL) {tnode->number = number;tnode->next = next;}

return tnode;}

/* preform merge sort on the linked list */struct node *mergesort(struct node *head) {struct node *head_one;struct node *head_two;


51/144



if((head == NULL) || (head->next == NULL))return head;

head_one = head;head_two = head->next;

while((head_two != NULL) && (head_two->next != NULL)) {head = head->next;head_two = head->next->next;}head_two = head->next;head->next = NULL;

return merge(mergesort(head_one), mergesort(head_two));}

/* merge the lists.. */struct node *merge(struct node *head_one, struct node *head_two){struct node *head_three;

if(head_one == NULL)return head_two;

if(head_two == NULL)return head_one;

if(head_one->number < head_two->number) {head_three = head_one;

head_three->next = merge(head_one->next, head_two);} else {head_three = head_two;head_three->next = merge(head_one, head_two->next);}

return head_three;}Msort Merge sort#define MAXARRAY 10

void mergesort(int a[], int low, int high);

int main(void) {int array[MAXARRAY];int i = 0;

/* load some random values into the array */for(i = 0; i < MAXARRAY; i++)
http://free-c-programs.blogspot.com/2008/12/msort-merge-sort.htmlhttp://free-c-programs.blogspot.com/2008/12/msort-merge-sort.html


52/144


53/144



a[i + low] = working[merge2++];elsea[i + low] = working[merge1++];elsea[i + low] = working[merge2++];

elsea[i + low] = working[merge1++];}}Multiplication of Two Matrices//Multiplication of Matrix#include

#include int m1,n1,m2,n2,i,j,k,z[10][10]={0};void value_sub(int a,int b,int arr[][10] )

{

for(i=0;i


54/144



for(i=0;i


55/144



printf(\n\n);

mat_mul(m1,n2,A,B);

}

else

printf(Matrix multiplication cannot be done);

getch();

}SUM,SUB,PRODUCT,DIVISION#includevoid main (){int a,b,c,d,e,f;clrscr();printf ("Enter A: ");scanf ("%d",&a);printf ("Enter B: ");scanf ("%d",&b);c=a+b;d=a-b;e=a*b;f=a/b;

printf ("\nSum is : %d",c);printf ("\nSubtraction is : %d",d);printf ("\nMultiplication is : %d",e);printf ("\nDivision is : %d",f);getch ();}

Output
http://free-c-programs.blogspot.com/2007/08/three-actions-in-one.htmlhttp://bp0.blogger.com/_urRtV3T_f1g/RtPaZGrnSSI/AAAAAAAAABA/GqNbF_L8eLI/s1600-h/output.JPGhttp://free-c-programs.blogspot.com/2007/08/three-actions-in-one.html


56/144


57/144



printf("Input value of B: ");scanf("%d",&b);a=a^b;b=b^a;a=b^a;

printf("After Swapping:\n");printf("Value of A: %d",a);printf("\nValue of B: %d",b);getch();}Ohms law example In C#include#include#includeint main(){char ch;float voltage , current , resistance , result;printf("Ohms law calculator.\n");printf("Please choose from following calculcations.\n");printf("1. choose 1 to calculate the voltage.\n");printf("2. choose 2 to calculate the current.\n");printf("3. choose 3 to calculate the resistance.\n");printf("Anything else to quit.\n");scanf("%c",&ch);switch(ch){case '1' :

printf("please enter the current in amps.\n");scanf("%f",t);printf("Now enter the resistance in ohms.\n");scanf("%f",&resistance);result = current * resistance;printf("The voltage is %0.2f volts.\n",result);break;case '2' :printf("please enter the voltage in volts.\n");scanf("%f",&voltage);printf("Now enter the resistance in ohms.\n");

scanf("%f",&resistance);result = voltage / resistance;printf("The current is %0.2f amps.\n",result);break;case '3' :printf("please enter the voltage in volts.\n");scanf("%f",&voltage);printf("Now enter the current in amps.\n");
http://free-c-programs.blogspot.com/2008/12/ohms-law-example-in-c.htmlhttp://free-c-programs.blogspot.com/2008/12/ohms-law-example-in-c.html


58/144



scanf("%f",t);result = voltage / current;printf("The resistance is %0.2f ohms.\n",result);break;default :

exit(0);break;}return 0;}Print a double pyramidvoid main(void){clrscr();int i,j,k,l,b,n;printf("Enter the value of N:");scanf("%d",&n);for(i=0;i{printf("");for(l=0;lprintf(" ");for(j=i+1;ji;k--)printf("%d",k);}b=n-1;

for(i=0;i{printf("");for(l=n-2;l>i;l--)printf(" ");for(j=b;j=b;k--)printf("%d",k);b--;}

getch();}Print Armstrong numbers Less Than 1000#include#includevoid main(){int q,a,b,c,z,x,n=1;
http://free-c-programs.blogspot.com/2008/12/print-double-pyramid.htmlhttp://free-c-programs.blogspot.com/2011/08/print-armstrong-numbers-less-than-1000.htmlhttp://free-c-programs.blogspot.com/2011/08/print-armstrong-numbers-less-than-1000.htmlhttp://free-c-programs.blogspot.com/2008/12/print-double-pyramid.html


59/144



clrscr();printf(" OUTPUT :");while(nb&&a>c)

if(b>c)printf("%d is the second largest no.",b);elseprintf("%d is the second largest no.",c);

if(b>a&&b>c)

if(a>c)

printf("the second largest no. is % d",a);elseprintf(" the second largest no. is %d",c);

if(c>a&&c>b)
http://free-c-programs.blogspot.com/2011/08/print-second-largest-among-given-three_19.htmlhttp://free-c-programs.blogspot.com/2011/08/print-second-largest-among-given-three_19.html


60/144


61/144



getch();}

Progam that gives length of side of a Triangle//Progam that gives all details of a Triangle given the lengthsof its sides

#include#include#include#include

main(){clrscr();float a,b,c,S,D,A,B,C,Area,R;printf("Enter the lengths of the three sides of the triangle:");scanf("%f%f%f",&a,&b,&c);

S = (a+b+c)/2.0; // S is the semiperimeter of the triangleD = S*(S-a)*(S-b)*(S-c);//D is the square of the area of thetriangleif(D


62/144



B = (180.0/3.1415926)*asin(b/(2.0*R));// decimal places ofaccuracy andalsoC = (180.0/3.1415926)*asin(c/(2.0*R));// note that the 7thdecimal place

// 6 and not 7 as it had to be if wereif(A==90.0 || B==90.0 || C==90.0)// approximated to 7 decimalplacesprintf("The triangle is RIGHT ANGLED");if(A90.0)printf("The triangle is OBTUSE ANGLED");

printf("The angles are as follows :");printf("A = %.2f degrees",A);printf("B = %.2f degrees",B);printf("C = %.2f degrees",C);printf("Where A,B,C stand for angles opposite tosides%.2f,%.2f,%.2f",a,b,c);printf(" respectively");

getch();return 0;}Program for conversion of Decimal to Roman Number#include

main(){int a,b,c,d,e;clrscr();printf("Input a number (between 1-3000):");scanf("%d",&e);while (e==0||e>3000){printf ("ERROR: Invalid Input!");printf ("Enter the number again:");

scanf ("%d",&e);}if (e>3000)printf("Invalid");a = (e/1000)*1000;b = ((e/100)%10)*100;c = ((e/10)%10)*10;d = ((e/1)%10)*1;
http://free-c-programs.blogspot.com/2008/12/program-for-conversion-of-decimal-to.htmlhttp://free-c-programs.blogspot.com/2008/12/program-for-conversion-of-decimal-to.html


63/144



if (a ==1000)printf("M");else if (a ==2000)printf("MM");

else if (a ==3000)printf("MMM");

if (b == 100)printf("C");else if (b == 200)printf("CC");else if (b == 300)printf("CCC");else if (b == 400)printf("CD");else if (b ==500)printf("D");else if (b == 600)printf("DC");else if (b == 700)printf("DCC");else if (b ==800)printf("DCCC");else if (b == 900)printf("CM");

if (c == 10)printf("X");else if (c == 20)printf("XX");else if (c == 30)printf("XXX");else if (c == 40)printf("XL");else if (c ==50)printf("L");else if (c == 60)

printf("LX");else if (c == 70)printf("LXX");else if (c ==80)printf("LXXX");else if (c == 90)printf("XC");


64/144


65/144



scanf("%d",&will);

/* Getting Input */for(i=0;i{

printf("Enter the item");scanf("%d",&num);insert(&ptr,num);}

getch();printf("INORDER TRAVERSAL");inorder(ptr);getch();printf("PREORDER TRAVERSAL");preorder(ptr);getch();printf("POSTORDER TRAVERSAL");postorder(ptr);getch();}


if((*p)==NULL){ printf("Leaf node created.");(*p)=malloc(sizeof(struct node));(*p)->left = NULL;(*p)->right = NULL;(*p)->data = num;return;}else{ if(num==(*p)->data){

printf("REPEATED ENTRY ERRORVALUE REJECTED");return;}if(numdata){printf("Directed to left link.");


66/144


67/144



elsereturn;}Program for demonstration of Tree Operations - INSERTION,INORDER .

# include# include# include

struct node{struct node *left;int data;struct node *right;};

void main(){void insert(struct node **,int);void inorder(struct node *);void postorder(struct node *);void preorder(struct node *);struct node *ptr;int will,i,num;ptr = NULL;ptr->data=NULL;clrscr();


/* Getting Input */for(i=0;i{printf("Enter the item");scanf("%d",&num);insert(&ptr,num);}

getch();printf("INORDER TRAVERSAL");inorder(ptr);getch();printf("PREORDER TRAVERSAL");preorder(ptr);getch();
http://free-c-programs.blogspot.com/2008/12/program-for-demonstration-of-tree.htmlhttp://free-c-programs.blogspot.com/2008/12/program-for-demonstration-of-tree.htmlhttp://free-c-programs.blogspot.com/2008/12/program-for-demonstration-of-tree.htmlhttp://free-c-programs.blogspot.com/2008/12/program-for-demonstration-of-tree.html


68/144



printf("POSTORDER TRAVERSAL");postorder(ptr);getch();}


if((*p)==NULL){ printf("Leaf node created.");(*p)=malloc(sizeof(struct node));(*p)->left = NULL;(*p)->right = NULL;(*p)->data = num;return;}else{ if(num==(*p)->data){printf("REPEATED ENTRY ERRORVALUE REJECTED");return;}if(numdata){

printf("Directed to left link.");insert(&((*p)->left),num);}else{printf("Directed to right link.");insert(&((*p)->right),num);}}return;

}

void inorder(struct node *p){if(p!=NULL){inorder(p->left);


69/144


70/144



scanf("%d", &a[0][2]);

for(i=1;i


71/144


72/144


73/144


74/144



{if(i%4==0)dd1+=1;}dd1=dd1+day1+(year1-ref)*365;

printf("No. of days of first date fronm the Jan 1 %d=%d",year1,dd1);/* Count for additional days due to leap years*/dd2=0;for(i=ref;i{if(i%4==0)dd2+=1;}dd2=func1(mon2)+dd2+day2+((year2-ref)*365);printf("No. of days from the reference year's first Jan =%d",dd2);printf("Therefore, diff between the two dates is %d",abs(dd2-dd1));

getch();}

int func1(x) //x for month y for dd{ int y=0;

switch(x){case 1: y=0; break;case 2: y=31; break;case 3: y=59; break;case 4: y=90; break;case 5: y=120;break;case 6: y=151; break;case 7: y=181; break;case 8: y=212; break;case 9: y=243; break;

case 10:y=273; break;case 11:y=304; break;case 12:y=334; break;default: printf("Error encountered"); exit(1);}return(y);}Program to construct a pyramid of any input numbers
http://free-c-programs.blogspot.com/2008/12/program-to-construct-pyramid-of-any.htmlhttp://free-c-programs.blogspot.com/2008/12/program-to-construct-pyramid-of-any.html


75/144



main(){int n,row=1,col=40,i=0,j,k=0,count=1;int a[10];clrscr();

i=n-1;printf("Pyramid of how many numbers? ");scanf("%d",&n);for (j=0;j\=1;row--){k=0;k=40-(4*(row-1));i=row-1;for (col=40;col>=k;col=(col-4)){gotoxy(col,row);printf("%d",a[i]);--i;}}

for (count=n;count>=1;count--)

{k=0;k=40+(4*(count-1));i=count-1;for (col=40;col


76/144



int a,b;clrscr();printf("Enter a number: ");scanf("%d",&a);printf("Enter another number: ");

scanf("%d",&b);printf("The greatest number is %d",(a+b+abs(a-b))/2);getch();}Program to find whether a number is odd or even#includeint main(){int number ;printf("Enter a whole number\n");scanf("%d",&number);if(number % 2 == 0)printf("number is even.\n");elseprintf("number is odd.\n");

return 0;}Program to Open a file, read a file and write to a file#includeint main(){float sales , commission;

FILE *fin, *fout;fin = fopen("c:\\pop.dat","r");fout = fopen("c:\\pop2.dat","w");while (fscanf(fin,"%f",&sales) != EOF){fprintf(fout,"Your sales for the year were %8.2f \n",sales);if(sales < 30000)commission = sales / 100 * 5;elsecommission = sales / 100 * 10;fprintf(fout,"Your commission is %8.2f",commission);

}return 0;}Pyramid using nested for loops#include#includevoid main(){
http://free-c-programs.blogspot.com/2008/12/program-to-find-whether-number-is-odd.htmlhttp://free-c-programs.blogspot.com/2008/12/program-to-open-file-read-file-and.htmlhttp://free-c-programs.blogspot.com/2011/08/pyramid-using-nested-for-loops.htmlhttp://free-c-programs.blogspot.com/2011/08/pyramid-using-nested-for-loops.htmlhttp://free-c-programs.blogspot.com/2008/12/program-to-open-file-read-file-and.htmlhttp://free-c-programs.blogspot.com/2008/12/program-to-find-whether-number-is-odd.html


77/144



int i,j;for(i=5;i>=1;i--){for(j=i;j>=1;j--){

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

OUTPUT

5 4 3 2 14 3 2 13 2 12 11Qcksort, quick sort#include

#define MAXARRAY 10

void quicksort(int arr[], int low, int high);

int main(void){

int array[MAXARRAY] = {0};int i = 0;


/* print the original array */printf("Before quicksort: ");for(i = 0; i < MAXARRAY; i++){

printf(" %d ", array[i]);}printf("\n");

quicksort(array, 0, (MAXARRAY - 1));

/* print the `quicksorted' array */printf("After quicksort: ");
http://free-c-programs.blogspot.com/2008/12/qcksort-quick-sort.htmlhttp://free-c-programs.blogspot.com/2008/12/qcksort-quick-sort.html


78/144



for(i = 0; i < MAXARRAY; i++) {printf(" %d ", array[i]);}printf("\n");

return 0;}

/* sort everything inbetween `low' `high' */void quicksort(int arr[], int low, int high){int i = low;int j = high;int y = 0;/* compare value */int z = arr[(low + high) / 2];

/* partition */do {/* find member above ... */while(arr[i] < z) i++;

/* find element below ... */while(arr[j] > z) j--;

if(i


79/144


80/144


81/144


82/144



{for (j = i; j


83/144



temp = *begin;*begin++ = *end;*end-- = temp;}}

int main( ){char s[] = "i like this program very much";char *temp = s;reverseWords(s);printf("%s", s);getchar();return 0;}reversing a linked list#include "stdio.h"#include "stdlib.h"

#define MAX 10 /* max of 10 elements */

struct lnode{int number;struct lnode *next;};

/* add a lnode at the beginning of the list */

void llist_add_begin(struct lnode **n, int val);/* reverse the whole list */void llist_reverse(struct lnode **n);/* display the whole linked list */void llist_display(struct lnode *n);

int main(void){struct lnode *new = NULL;int i = 0;

/* insert some numbers */for(i = 0; i


84/144


85/144



int main(void){int myArray[10] = {12,23,56,35,18,65,12,87,73,9};int result,number;print_arr(myArray,10);

number = 65;result = search_arr(myArray,10,number);if(result == -1)printf("%d was not found.\n",number);elseprintf("Found %d\n",result);return 0;}

void print_arr(int myArray[], int elements){int i;

for(i = 0;i < elements;i++){printf("%d ",myArray[i]);}printf("\n");}

int search_arr(int myArray[], int elements, int number){int i;

for(i = 0;i < elements;i++){if(myArray[i] == number)return(number);}return(-1);}Search An Element in Linked List#include stdio.h>#include conio.h>#include malloc.h>

struct linlst{int info;struct link *next;}start, *node;

int search(int);
http://free-c-programs.blogspot.com/2008/12/search-element-in-linked-list.htmlhttp://free-c-programs.blogspot.com/2008/12/search-element-in-linked-list.html


86/144



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{node->next=(struct linlst *)malloc(sizeof(struct linlst));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(posnext!=NULL){if(node->info==item)break;elsen++;node=node->next;}


87/144



return n;}SEARCHING OF THE ELEMENTS OF BINARY NUMBERmain(){

int a[100],i,n,j,search,mid,temp;printf("\n how many no's in array");scanf("%d",&n);printf("\n enter %d elements in array",n);for(i=0;iscanf("%d",&a[i]);for(i=0;i{for(j=i+1;j{if(a[i]>a[j]){temp=a[i];a[i]=a[j];a[j]=temp;}}printf("%4d",a[i]);}printf("\n enter search element");scanf("%d",&search);mid=n/2;if(a[mid]==search)

{printf("\n location of searched element %d ",mid);}if(search>a[mid]){for(i=mid+1;i{if(a[i]==search){printf("\n location of sarched element is %d",i);}

elsefor(i=0;i{if(a[i]==search)printf("\n location of searched element %d",i+1);}xcgetch();}
http://free-c-programs.blogspot.com/2008/12/searching-of-elements-of-binary-number.htmlhttp://free-c-programs.blogspot.com/2008/12/searching-of-elements-of-binary-number.html


88/144



}}Ssort, selection sort in array#include "stdio.h"

void selection_sort(int a[], int size);

int main(void){int arr[10] = {10, 2, 4, 1, 6, 5, 8, 7, 3, 9};int i = 0;

printf("before:\n");for(i = 0; i < 10; i++) printf("%d ", arr[i]);printf("\n");

selection_sort(arr, 10);

printf("after:\n");for(i = 0; i < 10; i++) printf("%d ", arr[i]);printf("\n");

return 0;}

void selection_sort(int a[], int size){int i = 0;

int j = 0;int large = 0;int index = 0;

for(i = size - 1; i > 0; i--){large = a[0];index = 0;for(j = 1; j large){

large = a[j];index = j;}a[index] = a[i];a[i] = large;}}Selection sort linked list
http://free-c-programs.blogspot.com/2008/12/ssort-selection-sort-in-array.htmlhttp://free-c-programs.blogspot.com/2008/12/selection-sort-linked-list.htmlhttp://free-c-programs.blogspot.com/2008/12/selection-sort-linked-list.htmlhttp://free-c-programs.blogspot.com/2008/12/ssort-selection-sort-in-array.html


89/144



#include "stdio.h"#include "stdlib.h"

#define MAX 10

struct lnode{int data;struct lnode *next;} *head, *visit;

/* add a new entry to the linked list */void llist_add(struct lnode **q, int num);/* preform a selection sort on the linked list */void llist_selection_sort(void);/* print the entire linked list */void llist_print(void);

int main(void){/* linked list */struct lnode *newnode = NULL;int i = 0; /* a general counter */

/* load some random values into the linked list */for(i = 0; i < MAX; i++) {llist_add(&newnode, (rand() % 100));}

head = newnode;printf("Before selection sort:\n");llist_print();printf("After selection sort:\n");llist_selection_sort();llist_print();

return 0;}

/* adds a node at the end of a linked list */void llist_add(struct lnode **q, int num){struct lnode *temp;

temp = *q;

/* if the list is empty, create first node */


90/144



if(*q == NULL) {*q = malloc(sizeof(struct lnode));temp = *q;} else {/* go to last node */

while(temp->next != NULL)temp = temp->next;

/* add node at the end */temp->next = malloc(sizeof(struct lnode));temp = temp->next;}

/* assign data to the last node */temp->data = num;temp->next = NULL;}

/* print the entire linked list */void llist_print(void){visit = head;

/* traverse the entire linked list */while(visit != NULL){printf("%d ", visit->data);visit = visit->next;

}printf("\n");}

void llist_selection_sort(void){struct lnode *a = NULL;struct lnode *b = NULL;struct lnode *c = NULL;struct lnode *d = NULL;struct lnode *tmp = NULL;

a = c = head;while(a->next != NULL){d = b = a->next;while(b != NULL) {if(a->data > b->data){


91/144



/* neighboring linked list node */if(a->next == b){if(a == head){

a->next = b->next;b->next = a;tmp = a;a = b;b = tmp;head = a;c = a;d = b;b = b->next;} else {a->next = b->next;b->next = a;c->next = b;tmp = a;a = b;b = tmp;d = b;b = b->next;}} else{if(a == head){

tmp = b->next;b->next = a->next;a->next = tmp;d->next = a;tmp = a;a = b;b = tmp;d = b;b = b->next;head = a;} else

{tmp = b->next;b->next = a->next;a->next = tmp;c->next = b;d->next = a;tmp = a;a = b;


92/144



b = tmp;d = b;b = b->next;}}

} else{d = b;b = b->next;}}c = a;a = a->next;}}Shsort, shell sort array#include "stdio.h"

#define MAXARRAY 10

void shellsort(int a[], int total, int index);

int main(void){int array[MAXARRAY] = {0};int i = 0;

/* load some random values into the array */

for(i = 0; i < MAXARRAY; i++)array[i] = rand() % 100;

/* print the original array */printf("Before shellsort: ");for(i = 0; i < MAXARRAY; i++){printf(" %d ", array[i]);}printf("\n");

shellsort(array, MAXARRAY, 1);

/* print the `shellsorted' array */printf("After shellsort: ");for(i = 0; i < MAXARRAY; i++){printf(" %d ", array[i]);}
http://free-c-programs.blogspot.com/2008/12/shsort-shell-sort-array.htmlhttp://free-c-programs.blogspot.com/2008/12/shsort-shell-sort-array.html


93/144



printf("\n");

return 0;}

void shellsort(int a[], int total, int index){int i = 0;int j = 0;int k = 0;int l = 0;

for(k = 0; k < index; k++){for(i = k; i < total; i += index){l = a[i];for(j = (i - index); j >= 0; j -= index){if(a[j] > l)a[j + index] = a[j];elsebreak;}a[j + index] = l;}}

return;}Square Root of a number by using simple calculations#include#includemain(){float a,b,e=0.00001,p,k;clrscr();textcolor(GREEN);do {

printf("*******************************************************");printf(" PROGRAM TO FIND SQUARE ROOT OF A NUMBERxDB");printf("*********************************************************");cprintf("ENTER A NUMBER(-1 to Quit) :");scanf("%f",&k);
http://free-c-programs.blogspot.com/2008/12/square-root-of-number-by-using-simple.htmlhttp://free-c-programs.blogspot.com/2008/12/square-root-of-number-by-using-simple.html


94/144


95/144



printf("%2d: %s", i, strarray[i]);

/* free mem... */for(i = 0; i < strcount; i++)free(strarray[i]);

free(strarray);return 0;}


void sortstrarr(void *array, unsigned n){qsort(array, n, sizeof(char *), cmpr);}Shsort, shell sort array#include "stdio.h"

#define MAXARRAY 10

void shellsort(int a[], int total, int index);

int main(void){

int array[MAXARRAY] = {0};int i = 0;


/* print the original array */printf("Before shellsort: ");for(i = 0; i < MAXARRAY; i++){

printf(" %d ", array[i]);}printf("\n");

shellsort(array, MAXARRAY, 1);

/* print the `shellsorted' array */printf("After shellsort: ");
http://free-c-programs.blogspot.com/2008/12/shsort-shell-sort-array.htmlhttp://free-c-programs.blogspot.com/2008/12/shsort-shell-sort-array.html


96/144



for(i = 0; i < MAXARRAY; i++){printf(" %d ", array[i]);}printf("\n");

return 0;}

void shellsort(int a[], int total, int index){int i = 0;int j = 0;int k = 0;int l = 0;

for(k = 0; k < index; k++){for(i = k; i < total; i += index){l = a[i];for(j = (i - index); j >= 0; j -= index){if(a[j] > l)a[j + index] = a[j];elsebreak;}

a[j + index] = l;}}

return;}String array Qsort#include#include#include

void sortstrarr(void *array, unsigned n);static int cmpr(const void *a, const void *b);

int main(void){char line[1024];char *line_array[1024];int i = 0;
http://free-c-programs.blogspot.com/2008/12/string-array-qsort.htmlhttp://free-c-programs.blogspot.com/2008/12/string-array-qsort.html


97/144



int j = 0;

while((fgets(line, 1024, stdin)) != NULL)if(i < 1024)line_array[i++] = strdup(line);

elsebreak;

sortstrarr(line_array, i);

while(j < i)printf("%s", line_array[j++]);

return 0;}


void sortstrarr(void *array, unsigned n){qsort(array, n, sizeof(char *), cmpr);}SUM,SUB,PRODUCT,DIVISION#includevoid main ()

{int a,b,c,d,e,f;clrscr();printf ("Enter A: ");scanf ("%d",&a);printf ("Enter B: ");scanf ("%d",&b);c=a+b;d=a-b;e=a*b;f=a/b;

printf ("\nSum is : %d",c);printf ("\nSubtraction is : %d",d);printf ("\nMultiplication is : %d",e);printf ("\nDivision is : %d",f);getch ();}

Output
http://free-c-programs.blogspot.com/2007/08/three-actions-in-one.htmlhttp://free-c-programs.blogspot.com/2007/08/three-actions-in-one.html


98/144



Method #2

WAP TO SUM, SUBTRACT, MULTIPLY & DIVISION OF TWO NUMBERS (3VARIABLES)

#includevoid main (){int a,b,c;clrscr();printf ("Enter A: ");scanf ("%d",&a);printf ("Enter B: ");scanf ("%d",&b);c=a+b;printf ("\nSum is %d",c);

c=a-b;printf ("\nSubtraction is %d",c);c=a*b;printf ("\nMultiplication is %d",c);c=a/b;printf ("\nDivision is %d",c);getch ();}

Output
http://bp0.blogger.com/_urRtV3T_f1g/RtPaZGrnSSI/AAAAAAAAABA/GqNbF_L8eLI/s1600-h/output.JPG


99/144



Subtraction of Two Matrices

#include#include

//Read Matrixvoid read_mat(float a[][10],int m,int n){int i,j;printf("\n\nEnter %d X %d matrix below:\n",m,n);for(i=0;i


100/144



//main functionvoid main(){float x[10][10],y[10][10],z[10][10];int m,n;

clrscr();

//Accept two matricesprintf("\n\nEnter order of matrix \n");scanf("%d %d",&m,&n);read_mat(x,m,n);read_mat(y,m,n);

//call sub_mat() functionsub_mat(x,y,z,m,n);printf("\n\nSUBTRACTION OF THE GIVEN MATRICES IS:\n");write_mat(z,m,n);getch();}This program calculates an average of the numbers entered#includeint Average(int i);

int main(){int num;do{

printf("Enter numbers.\n");scanf("%d",&num);if(num != -1)printf("The average is %d", Average(num));printf("\n");

}while(num>-1);

return 0;}

int Average(int i){static int sum = 0, count = 0;sum = sum + i;count++;return sum / count;}To delete n Characters from a given position in a given string
http://free-c-programs.blogspot.com/2008/12/this-program-calculates-average-of_14.htmlhttp://free-c-programs.blogspot.com/2011/05/to-delete-n-characters-from-given.htmlhttp://free-c-programs.blogspot.com/2011/05/to-delete-n-characters-from-given.htmlhttp://free-c-programs.blogspot.com/2008/12/this-program-calculates-average-of_14.html


101/144



#include #include #include void delchar(char *x,int a, int b);void main()

{char string[10];int n,pos,p;clrscr();puts(Enter the string);gets(string);printf(Enter the position from where to delete);scanf(%d,&pos);printf(Enter the number of characters to be deleted);scanf(%d,&n);delchar(string, n,pos);getch();}// Function to delete n charactersvoid delchar(char *x,int a, int b){if ((a+b-1)


102/144



c++;}p=l-c;printf("\n\n\n\t\t------------OUTPUT------------");printf("\n\nthe total no. of consonants in the string

are=%d",p);//printing outputgetch();}Treesort - string array#include "stdio.h"#include "string.h"#include "stdlib.h"

struct tnode{char *str;struct tnode *left;struct tnode *right;};

void insert(struct tnode **p, char *value);void print(struct tnode *root);

int main(void){char line[1024];struct tnode *root;

root = NULL;while((fgets(line, 1024, stdin)) != NULL)insert(&root, line);

print(root);return 0;}

/* call by reference .. ! */void insert(struct tnode **p, char *value){

if(!*p) {*p = (struct tnode *)malloc(sizeof(struct tnode));(*p)->left = (*p)->right = NULL;(*p)->str = strdup(value);return;}

if(strcmp(value, (*p)->str) < 0)
http://free-c-programs.blogspot.com/2008/12/treesort-string-array.htmlhttp://free-c-programs.blogspot.com/2008/12/treesort-string-array.html


103/144



insert(&(*p)->left, value);elseinsert(&(*p)->right, value);}

/* inorder binary tree print ... */void print(struct tnode *root){if(root != NULL){print(root->left);printf("%s", root->str);print(root->right);}}Use of Strlen() Function#include#includevoid main(void){char str[31];int len;printf("\nEnter any String");gets(str);len=strlen(str);printf("\nNumber of Character in%s=%d\n",str,len);}INCREMENTAL / DECREMENTAL

WAP TO ADD 1 & SUBTRACT 1 FROM VALUE OF A & B(INCREMENTAL & DECREMENTAL OPERATORS)void main (){int a,b;clrscr();printf ("Enter A: ");scanf ("%d",&a);printf ("Enter B: ");scanf ("%d",&b);a++;

b--;printf ("\nA is %d",a);printf ("\nB is %d",b);getch ();}
http://free-c-programs.blogspot.com/2010/12/use-of-strlen-function.htmlhttp://free-c-programs.blogspot.com/2007/08/incremental-decremental.htmlhttp://free-c-programs.blogspot.com/2007/08/incremental-decremental.htmlhttp://free-c-programs.blogspot.com/2010/12/use-of-strlen-function.html


104/144



ADD ENTERED DIGITSvoid main (){int no,r,res;clrscr ();printf ("Enter any value: ");scanf ("%d",&no);r=res=0;while (no>0){r=no%10;no=no/10;res=(res+r);}printf ("Sum is %d",res);getch ();}

ADD TWO VARIABLES#includevoid main (){int a,b,c;clrscr();printf ("Enter A: ");scanf ("%d",&a);printf ("Enter B: ");scanf ("%d",&b);c=a+b;printf ("\nSum is %d",c);getch ();}
http://free-c-programs.blogspot.com/2007/08/add-entered-digits.htmlhttp://free-c-programs.blogspot.com/2007/08/add-two-variables_28.htmlhttp://bp3.blogger.com/_urRtV3T_f1g/RtQDimrnSsI/AAAAAAAAAEQ/-z1d7jPCcX0/s1600-h/output.JPGhttp://bp1.blogger.com/_urRtV3T_f1g/RtPgqWrnSiI/AAAAAAAAADA/-hn8EJgb_XU/s1600-h/output.JPGhttp://bp3.blogger.com/_urRtV3T_f1g/RtQDimrnSsI/AAAAAAAAAEQ/-z1d7jPCcX0/s1600-h/output.JPGhttp://bp1.blogger.com/_urRtV3T_f1g/RtPgqWrnSiI/AAAAAAAAADA/-hn8EJgb_XU/s1600-h/output.JPGhttp://free-c-programs.blogspot.com/2007/08/add-two-variables_28.htmlhttp://free-c-programs.blogspot.com/2007/08/add-entered-digits.html


105/144


106/144



for (j=0;j


107/144


108/144



printf("\nSony is %ld ",tb);break;case 4:tb=(long)qty*11000;printf("\nSamsung is %ld ",tb);break;

case 5:tb=(long)qty*13000;printf("\nLG is %ld ",tb);break;Default:printf("Wrong Choice...");}dis=(tb*10)/100;nb=tb-dis;printf("\nDiscount is %ld",dis);printf("\nNet bill is %ld",nb);getch();}GOOD ELSE BADvoid main (){int a;clrscr ();printf ("Enter any Number: ");scanf ("%d",&a);if (a==10)goto g;else

goto b;g:printf ("Good");goto end;b:printf ("Bad");goto end;end:getch ();}BIGGER & EQUAL

WAP TO FIND OUT BIGGER & EQUAL NUMBER FROM THREE NUMBERS(TERNARY OPERATORS)void main (){int a,b,c;clrscr ();printf ("Enter the value of A: ");scanf("%d",&a);
http://free-c-programs.blogspot.com/2007/08/wap-to-find-if-number10-then-good-else.htmlhttp://free-c-programs.blogspot.com/2007/08/wap-to-find-out-bigger-equal-number.htmlhttp://free-c-programs.blogspot.com/2007/08/wap-to-find-out-bigger-equal-number.htmlhttp://free-c-programs.blogspot.com/2007/08/wap-to-find-if-number10-then-good-else.html


109/144



printf ("Enter the value of B: ");scanf ("%d",&b);printf ("Enter the value of C: ");scanf ("%d",&c);(a>b && a>c)?printf("A is Big"):(b>a && b>c)?printf("B is

Big"):(a==b && b==c)?printf("All are Eqaul"):printf("C is Big");getch ();}

BIGGER NUMBERWAP TO FIND OUT BIGGER NUMBER FROM TWO NUMBERS(TERNARY OPERATORS)

void main (){int a,b;clrscr ();printf ("Enter the value of A: ");scanf("%d",&a);printf ("Enter the value of B: ");scanf ("%d",&b);(a>b)? printf ("A is Big"):printf("B is Big");

getch ();}EVEN OR ODDvoid main (){int a;clrscr ();printf ("Enter the value of A: ");scanf("%d",&a);if (a%2==0){printf ("\nNumber is Even");}else{printf("\nNumber is Odd");}getch ();}
http://free-c-programs.blogspot.com/2007/08/even-or-odd.htmlhttp://bp0.blogger.com/_urRtV3T_f1g/RtPfUGrnSdI/AAAAAAAAACY/nmES5F4tCmY/s1600-h/output.JPGhttp://free-c-programs.blogspot.com/2007/08/even-or-odd.html


110/144


111/144



SQUARE ROOTvoid main (){int no, a;clrscr ();

printf ("Enter Number : ");scanf ("%d",&no);a=sqrt(no);printf ("\nResult is %d", a);getch ();}TOTAL BILL/ DISCOUNT Avoid main (){int b,dis,n;clrscr ();printf ("Enter Bill: ");scanf ("%d",&b);dis=(b=500 && b=1000 &&b


112/144


113/144



LEAP YEARWAP TO FIND OUT YEAR IS LEAP OR NOT (IF-ELSE)void main (){int a;

clrscr ();printf ("Enter the Year: ");scanf("%d",&a);if (a%4==0){printf ("\nYear is Leap");}else{printf("\nYear is not Leap");}getch ();}SIZE OF VARIABLEvoid main(){int a;float b;double c;char ch;long d;char nm[10];clrscr();

printf("\nInt size is \t:%d", sizeof (a));printf("\nFloat size is \t:%d", sizeof (b));printf("\nDouble size is \t:%d", sizeof (c));printf("\nChar size is \t:%d", sizeof (ch));printf("\nLong size is \t:%d", sizeof (d));printf("\nString size is \t:%d", sizeof (nm));getch ();}

FIND STRING
http://free-c-programs.blogspot.com/2007/08/leap-year.htmlhttp://free-c-programs.blogspot.com/2007/08/size-of-variable.htmlhttp://free-c-programs.blogspot.com/2007/08/find-string.htmlhttp://bp1.blogger.com/_urRtV3T_f1g/RtQF4GrnS2I/AAAAAAAAAFg/4ROswUpFWPI/s1600-h/output.JPGhttp://free-c-programs.blogspot.com/2007/08/find-string.htmlhttp://free-c-programs.blogspot.com/2007/08/size-of-variable.htmlhttp://free-c-programs.blogspot.com/2007/08/leap-year.html


114/144



void main (){char *k="Borland International", *g, *p;clrscr ();printf ("Enter string to find: ");

gets (g);p=strstr(k,g);printf ("%s",p);getch ();}PALANDROM NUMBERWAP TO FIND THAT NUMBER IS PALANDROM OR NOT (121=121)#includevoid main (){int no,r,res,temp=0;clrscr ();printf ("Enter Number: ");scanf ("%d",&no);r=res=0;temp=no;while (no>0){r=no%10;no=no/10;res=(res*10)+r;}if (temp==res)

printf("Number is Palandrom");elseprintf("Number is not Palandrom");getch ();}PRIME NUMBERvoid main (){int no,i=2;clrscr ();printf ("Enter Number: ");

scanf ("%d",&no);while (i


115/144


116/144



printf(GCD of %d and %d Using Recursive Function is

%d\n,a,b,GcdRecursive(a,b));

printf(GCD of %d and %d Using Non-Recursive Function is%d\n,a,b,GcdNonRecursive(a,b));

getch();

}

/* Recursive Function*/

unsigned int GcdRecursive(unsigned m, unsigned n)

{

if(n>m)

return GcdRecursive(n,m);

if(n==0)

return m;

else

return GcdRecursive(n,m%n);

}

/* Non-Recursive Function*/

unsigned int GcdNonRecursive(unsigned p,unsigned q)

{

unsigned remainder;

remainder = p-(p/q*q);

if(remainder==0)

return q;

elseGcdRecursive(q,remainder);}


117/144



STRING LENGTHvoid main (){char ch [20];int l;

clrscr ();printf ("Enter String: ");gets (ch);l=strlen(ch);printf ("Length of string is %d",l);getch ();}

PRINT NAME 10 TIMESvoid main (){int a=1;clrscr();do{printf ("Jagjeet\n");a++;}while (a


118/144


119/144



c=a+b;printf ("\n%d",c);a=b;b=c;}

getch ();}ENTER & DISPLAYvoid main (){char name [15];clrscr ();printf ("Enter your name: ");gets (name);printf ("\nme is: %s",name);getch ();}NUMBERS DIVIDED BY 7void main (){int a;clrscr ();a=1;while (a


120/144



int a=1,sqr=0,cube=0;clrscr ();while (a


121/144



scanf ("%d",&a);printf ("Enter End: ");scanf ("%d",&b);do{

printf ("%d\n",a);a++;}while (a


122/144



clrscr();do{printf ("Enter Password to see the detail of programmer:\n");scanf ("%d",&pass);

}while (pass!=464);printf ("\nJagjeet Singh");printf ("\nB.Sc. (I.T.)\nPunjab Technical University");getch ();}

VALUE OF DATA TYPEvoid main (){int a=10;float d=40.50;char ch='A';

double dbl=78.9786;long lng=7897711;char nm [10]="JIMMY";clrscr ();printf ("\nInteger value is %d",a);printf ("\nFloat value is %.2f",d);printf ("\nCharacter value is %c",ch);printf ("\nDouble value is %.4lf",dbl);printf ("\nLong value is %ld",lng);printf ("\nString value is %s",nm);getch ();}
http://free-c-programs.blogspot.com/2007/08/value-data-types.htmlhttp://bp3.blogger.com/_urRtV3T_f1g/RtQNVmrnTGI/AAAAAAAAAHg/wAnX-8IdQF4/s1600-h/output.JPGhttp://free-c-programs.blogspot.com/2007/08/value-data-types.html


123/144



REVERSE NUMBERvoid main (){int no,r,res;clrscr ();printf ("Enter any value: ");scanf ("%d",&no);

r=res=0;while (no>0){r=no%10;no=no/10;res=(res*10)+r;}printf ("\nReverse is %d",res);getch ();}Wap to reverse words

#include #include #include const int opt = 50;int main(){int i=0,j=0,c=0,vali[opt] = {0};char str1[opt],str2[opt]="",str3[opt]="",ch;printf("please enter your sentence :");gets(str1);for(i=0;str1[i] != '\0';i++){if(str1[i] == ' '){vali[j+1] = i;j++;}}c = j;for(i=0;i


124/144



c--;}strcat(str2,str1);printf("\nyour reversed sentence is :");puts(str2);

getch();return 0;}SUM OF ARRAYvoid main (){int no[5],i,sum;clrscr ();for (i=0;i


125/144



printf("\tEnter a no.");scanf("%d",&n);t=n;while(n!=0){

r=n%10;sum=sum+r*r*r;n=n/10;}

if(sum==t)printf("The no. %d is armstrong",t);elseprintf("The no. %d is not an armstrong",t);getch();}

Whether the given no. Is palindrome or not#include#includevoid main(){int n,r,t,sum=0;clrscr();printf(" OUTPUT:\n");printf("\tEnter a no.");scanf("%d",&n);t=n;while(n!=0){

r=n%10;sum=sum*10+r;n=n/10;}

if(sum==t)printf("\tThe no. %d is a pallindrome",t);elseprintf("\tThe no. %d is not a pallindrome",t);getch();}

Write a C program to find both the largest and smallest number

in a list of integersmain( )

{

float largest(float a[ ], int n);

float value[4] = {2.5,-4.75,1.2,3.67};
http://free-c-programs.blogspot.com/2011/08/whether-given-no-is-palindrome-or-not.htmlhttp://free-c-programs.blogspot.com/2011/05/write-c-program-to-find-both-largest.htmlhttp://free-c-programs.blogspot.com/2011/05/write-c-program-to-find-both-largest.htmlhttp://free-c-programs.blogspot.com/2011/05/write-c-program-to-find-both-largest.htmlhttp://free-c-programs.blogspot.com/2011/05/write-c-program-to-find-both-largest.htmlhttp://free-c-programs.blogspot.com/2011/08/whether-given-no-is-palindrome-or-not.html


126/144



printf(%f\n, largest(value,4));

}

float largest(float a[], int n)

{

int i;

float max;

max = a[0];

for(i = 1; i < n; i++)

if(max < a[i])

max = a[i];

return(max);

}write a c program to find prime numbersmain(){int i,j=2,ch=0;

clrscr();printf("\nENTER ANY NUMBER");scanf("%d",&i);while(j


127/144



}}Write a C program to find the sum of individual digits of apositive integer#include

#include

void main()

{

int num, k=1, sum=0;

clrscr();

printf(Enter the number whose digits are to be added:);

scanf(%d,&num);

while(num!=0)

{

k=num%10;

sum=sum+k;

k=num/10;

num=k;

}

printf(Sum of the digits:%d,sum);

getch();

}

Write a C program to generate all the prime numbers between 1and n#include

void main()

{
http://free-c-programs.blogspot.com/2011/05/write-c-program-to-find-sum-of.htmlhttp://free-c-programs.blogspot.com/2011/05/write-c-program-to-find-sum-of.htmlhttp://free-c-programs.blogspot.com/2011/05/write-c-program-to-generate-all-prime.htmlhttp://free-c-programs.blogspot.com/2011/05/write-c-program-to-generate-all-prime.htmlhttp://free-c-programs.blogspot.com/2011/05/write-c-program-to-generate-all-prime.htmlhttp://free-c-programs.blogspot.com/2011/05/write-c-program-to-generate-all-prime.htmlhttp://free-c-programs.blogspot.com/2011/05/write-c-program-to-find-sum-of.htmlhttp://free-c-programs.blogspot.com/2011/05/write-c-program-to-find-sum-of.html


128/144



int no,counter,counter1,check;

clrscr();

printf();

printf(\n\n\n\t\t\tINPUT THE VALUE OF N: );

scanf(%d,&no);

printf(\n\nTHE PRIME NO. SERIES B/W 1 TO %d : \n\n,no);

for(counter = 1; counter 1 ; counter1)

if(counter%counter1 == 0)

{

check++; // INCREMENT CHECK IF NO. IS NOT A PRIME NO.

break;

}

if(check == 0)

printf(%d\t,counter);

}

getch();

}Write a C program to print all permutations of a given string# include# include/* Function to swap values at two pointers */void swap (char *x, char *y){
http://free-c-programs.blogspot.com/2011/05/write-c-program-to-print-all.htmlhttp://free-c-programs.blogspot.com/2011/05/write-c-program-to-print-all.html


129/144



char temp;temp = *x;*x = *y;*y = temp;}

/* Function to print permutations of stringThis function takes three parameters:1. String2. Starting index of the string3. Ending index of the string. */void permute(char *a, int i, int n){int j;if (i == n)printf("%s\n", a);else{for (j = i; j


130/144



// Now swap each word within sentence...x = buf-1;y = buf;

while(x++ < end){if(*x == '' || *x == ' '){rev(y,x-1);y = x+1;}}

// Now print the final string....printf("%s\n",buf);

return(0);}

// Function to reverse a string in place...void rev(char *l,char *r){char t;while(l


131/144



clrscr();

printf("Enter the co-efficients\n");

scanf("%f%f%f",&a,&b,&c);

disc=b*b-4*a*c;/*to find discriminant*/

if(disc>0)/*distinct roots*/

{

x1=(-b+sqrt(disc))/(2*a);

x2=(-b-sqrt(disc))/(2*a);

printf("The roots are distinct\n");

exit(0);

}

if(disc==0)/*Equal roots*/

{

x1=x2=-b/(2*a);

printf("The roots are equal\n");

printf("x1=%f\nx2=%f\n",x1,x2);

exit(0);

}

x1=-b/(2*a);/*complex roots*/

x2=sqrt(fabs(disc))/(2*a);

printf("The roots are complex\n");

printf("The first root=%f+

C language programs

Documents

Transcript of C language programs