C Program to implement the Newton- Gregory forward interpolation

C Program to implement the Newton- Gregory forward interpolation. Newtons – Gregory forward difference formula is a finite difference identity capable of giving an interpolated value between the tabulated points {fk} in terms of the first value f0 and powers of the forward difference Δ. In this program we used the multidimensional arrays and arrays in c. 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>#define MaxN 100#define Order_of_diff 4void main (){ float arr_x[MaxN+1], arr_y[MaxN+1], numerator=1.0, denominator=1.0, x, y, p, h, diff_table[MaxN+1][Order_of_diff+1]; int i,j,n,k; clrscr(); printf("Enter the value of n n"); scanf("%d",&n); printf("Enter the values of x and y"); for(i=0; i<=n; i++)  scanf("%f%f", &arr_x[i], &arr_y[i]); printf("Enter the value of x at which value of y is to be calculated"); scanf("%f", &x); h=arr_x-arr_x; for(i=0; i<=n-1; i++)  diff_table[i]=arr_y[i+1]-arr_y[i];/*Creating the difference table and calculating first order differences*/ for(j=2; j<=Order_of_diff; j++)/*Calculating higher order differences*/  for(i=0; i<=n-j; i++)   diff_table[i][j]=diff_table[i+1][j-1] - diff_table[i][j-1]; i=0; while(!(arr_x[i]>x)) /* Finding x0 */  i++; i--; p=(x-arr_x[i])/h; y=arr_y[i]; for (k=1; k<=Order_of_diff; k++) {  numerator *=p-k+1;  denominator *=k;  y +=(numerator/denominator)*diff_table[i][k]; } printf("When x=%6.1f, y=%6.2fn",x, y); getch();}`
`Read more Similar C ProgramsLearn C ProgrammingSimple C Programs`

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

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

our page!

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

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

C Program to check the given number is perfect or not.

C Program to check the given number is perfect or not?.  Perfect number is a positive integer that is equal to the sum of its proper positive divisors. example 6, divisor of 6 are 1, 2,3. Sum of divisors is 1+2+3=6.

`/************************************************************ 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>int main(){ int num,i=1,sum=0; printf("Enter a number: "); scanf("%d",&num); while(i<num){  if(num%i==0)   sum=sum+i;  i++; } if(sum==num)  printf("%d is a perfect number",i); else  printf("%d is not a perfect number",i); return 0;}`
`Read more Similar C ProgramsLearn C ProgrammingNumber System`

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

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

our page!

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

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

C Program to print Floyd’s triangle

Floyd’s triangle is the right angled triangular array of natural numbers. Here we used the nested For loop to print the Floyd’s triangle.

`/************************************************************ 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>int main(){ int i,j,n,k=1; printf("Enter the range: "); scanf("%d",&n); printf("FLOYD'S TRIANGLEnn"); for(i=1;i<=n;i++){  for(j=1;j<=i;j++,k++)   printf(" %d",k);  printf("n"); } return 0;}`
`Read more Similar C ProgramsLearn C ProgrammingNumber System`

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

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

our page!

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

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

C Program to sort the string, using shell sort technique.

C Program to sort the string, using shell sort technique. Shell sort is the one of the oldest sorting technique, quite well for all types of arrays in c. The shell sort is a “diminishing increment sort”, better known as a “comb sort” to the unwashed programming masses. The algorithm makes multiple passes through the list, and each time sorts a number of equally sized sets using the insertion sort . The size of the set to be sorted gets larger with each pass through the list, until the set consists of the entire list. This sets the insertion sort up for an almost-best case run each iteration with a complexity that approaches O(n) . 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 <string.h>#include <stdio.h>#include <stdlib.h>void shell_sort(char *chars, int c)  { register int i, j, space, k; char x, a; a=9; a=5; a=3; a=2; a=1; for(k=0; k < 5; k++) {  space = a[k];  for(i=space; i < c; ++i) {   x = chars[i];   for(j=i-space; (x < chars[j]) && (j >= 0); j=j-space)    chars[j+space] = chars[j];   chars[j+space] = x;  } }}int main() { char string; printf("Enter a string:"); gets(string); shell_sort(string, strlen(string)); printf("The sorted string is: %s.n", string); return 0;}`
`Read more Similar C ProgramsArray In CSorting Techniques`

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

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

our page!

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

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

C program to implement MERGE sort.

Merge sort is based on the divide conquer strategy. Array is divided in to two halves.if the array length is n, then it is divided into n/2,n/4,n/8…. and each part is sorted independently, then conquered into the sorted array. The efficiency of merge sort is O(n log n). 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 MAX_ARY 10void merge_sort(int x[], int end, int start);int main(void) { int ary[MAX_ARY]; int j = 0; printf("nnEnter the elements to be sorted: n"); for(j=0;j<MAX_ARY;j++)  scanf("%d",&ary[j]); /* array before mergesort */ printf("Before    :"); for(j = 0; j < MAX_ARY; j++)  printf(" %d", ary[j]); printf("n"); merge_sort(ary, 0, MAX_ARY - 1); /* array after mergesort */ printf("After Merge Sort :"); for(j = 0; j < MAX_ARY; j++)  printf(" %d", ary[j]); printf("n"); getch();}/* Method to implement Merge Sort*/void merge_sort(int x[], int end, int start) { int j = 0; const int size = start - end + 1; int mid  = 0; int mrg1 = 0; int mrg2 = 0; int executing[MAX_ARY]; if(end == start)  return; mid  = (end + start) / 2; merge_sort(x, end, mid); merge_sort(x, mid + 1, start); for(j = 0; j < size; j++)  executing[j] = x[end + j]; mrg1 = 0; mrg2 = mid - end + 1; for(j = 0; j < size; j++) {  if(mrg2 <= start - end)   if(mrg1 <= mid - end)    if(executing[mrg1] > executing[mrg2])     x[j + end] = executing[mrg2++];    else     x[j + end] = executing[mrg1++];   else    x[j + end] = executing[mrg2++];  else   x[j + end] = executing[mrg1++]; }}`
`Read more Similar C ProgramsArray In CSorting Techniques`

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

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

our page!

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

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

C Program to implement Insertion sort.

Insertion sorting technique is the elementary sorting technique. Insertion sort sorts one element at a time, It is just like manual sorting by humans. Insertion sort is better for small set of elements. Insertion sort is slower than heap sort, shell sort, quick sort,and merge sort. 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>void inst_sort(int []);void main(){ int num,count; clrscr(); printf("nEnter the Five Elements to sort:n"); for (count=0;count<5;count++)  scanf("%d",&num[count]); inst_sort(num); printf("nnElements after sorting: n"); for(count=0;count<5;count++)  printf("%dn",num[count]); getch();}// Function for Insertion Sortingvoid inst_sort(int num[]){ int i,j,k; for(j=1;j<5;j++) {  k=num[j];  for(i=j-1;i>=0 && k<num[i];i--)   num[i+1]=num[i];  num[i+1]=k; }}`
`Read more Similar C ProgramsArray In CSorting Techniques`

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

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

our page!

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

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

C Program to sort a linked list.

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 0struct 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 ProgramsData StructuresLearn C Programming`

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

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

our page!

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

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

C Program to reverse the first n characters in a file.

C Program to reverse the first n characters in a file using the command line arguments. Here we read the file name and n are specified on the command line. If file exists, it reverse the n characters, else it gives the error message. 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 <string.h>#include <process.h>void main(int argc, char *argv[]){ char a; char s; char n; int k; int j=0; int i; int len; FILE *fp; if(argc!=3) {  puts("Improper number of arguments.");  exit(0); } fp = fopen(argv,"r"); if(fp == NULL) {  puts("File cannot be opened.");  exit(0); } k=*argv-48; n = fread(a,1,k,fp); a[n]=''; len=strlen(a); for(i=len-1;i>=0;i--) {  s[j]=a[i];  printf("%c",s[j]);  j=j+1; } s[j+1]=''; getch();}/*(Note: The file name and n are specified on the command line.)*/`
`Read more Similar C ProgramsFile operationsLearn C Programming`

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

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

our page!

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

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

C Program to perform complex numbers operations using structure.

C Program to perform complex numbers operations using structure. Complex numbers are numbers which contains two parts, real part and imaginary part. Complex numbers are written as a+ib, a is the real part and b is the imaginary part. We used the structure in C to define the real part and imaginary part of the complex number.

`/************************************************************ 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<math.h>void arithmetic(int opern);struct comp{ double realpart; double imgpart;};void main(){ int opern; clrscr(); printf("nn ttt***** MAIN MENU *****"); printf("nn Select your option: n 1 : ADDn 2 : MULTIPLYn 0 : EXIT nntt Enter your Option [  ]bb"); scanf("%d",&opern); switch(opern) { case 0:  exit(0); case 1: case 2:  arithmetic(opern); default:  main(); }}void arithmetic(int opern){ struct comp w1, w2, w; printf("n Enter two Complex Numbers  (x+iy):n Real Part of First Number:"); scanf("%lf",&w1.realpart); printf("n Imaginary Part of First Number:"); scanf("%lf",&w1.imgpart); printf("n Real Part of Second Number:"); scanf("%lf",&w2.realpart); printf("n Imaginary Part of Second Number:"); scanf("%lf",&w2.imgpart); switch(opern) { /*addition of complex number*/ case 1:  w.realpart = w1.realpart+w2.realpart;  w.imgpart = w1.imgpart+w2.imgpart;  break;  /*multiplication of complex number*/ case 2:  w.realpart=(w1.realpart*w2.realpart)-(w1.imgpart*w2.imgpart);  w.imgpart=(w1.realpart*w2.imgpart)+(w1.imgpart*w2.realpart);  break; } if (w.imgpart>0)  printf("n Answer = %lf+%lfi",w.realpart,w.imgpart); else  printf("n Answer = %lf%lfi",w.realpart,w.imgpart); getch(); main();}`
`Read more Similar C ProgramsLearn C ProgrammingNumber System`

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

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

our page!

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

List of C Programs
(c) www.c-program-example.com

C program to find the 2’s complement of a binary number.

C Program to calculate the 2’s complement of a binary number. 2’s complement of a number is obtained by scanning it from right to left and complementing all the bits after the first appearance of a 1. Thus 2’s complement of 11100 is 00100. 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>void complement (char *a);void main(){ char a; int i; clrscr(); printf("Enter the binary number"); gets(a); for(i=0;a[i]!=''; i++) {  if (a[i]!='0' && a[i]!='1')  {   printf("The number entered is not a binary number. Enter the correct number");   exit(0);  } }complement(a);getch();}void complement (char *a){ int l, i, c=0; char b; l=strlen(a); for (i=l-1; i>=0; i--) {  if (a[i]=='0')  b[i]='1';  else  b[i]='0'; } for(i=l-1; i>=0; i--) { if(i==l-1) {  if (b[i]=='0')  b[i]='1';  else  {   b[i]='0';   c=1;  } } else {  if(c==1 && b[i]=='0')  {   b[i]='1';   c=0;  } else if (c==1 && b[i]=='1') {  b[i]='0';  c=1; }}}b[l]='';printf("The 2's complement is %s", b);}`
`Read more Similar C ProgramsLearn C ProgrammingNumber System`

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