ProgramsWay: Learn C Programming in an Easy Way

C Program to sort n numbers using Bubble Sort algorithm

2014-03-12T00:10:00.000-07:00

#include<stdio.h>
#include<stdlib.h>

int *a,n;
void bubblesort();
void swap_w(int,int);

main()
{
int i,j;
printf("Enter the number of elements ");
scanf("%d",&n);
a=(int *)calloc(n,sizeof(int));
printf("Enter the elements\n");
for(i=0;i<n;i++)
scanf("%d",a+i);
bubblesort(0,n-1);
printf("The sorted sequence is\n");
for(i=0;i<n;i++)
printf("%d ",a[i]);
printf("\n");
return;
}

void bubblesort()
{
int i,j;
for(i=0;i<n-1;i++)
for(j=n-1;j>=i+1;j--)
if(a[j]<a[j-1])
swap_w(j,j-1);
}

void swap_w(int i,int j)
{
int temp;
temp=a[i];
a[i]=a[j];
a[j]=temp;
return;
}

ARRAYS IN C

2014-01-09T07:30:00.001-08:00

Written by Kousik :

C provides some fundamental DATA types. They are int, float, char, double. They are very useful and important in C language. But they have a limiting fact. The fact is that a variable of these types can store only one value at a time. With variables of those types we cannot handle a large volume of data of same type at a time. So we need a powerful data type with which we can solve this problem. C supports such a data type called ARRAYS.

Definition: An array is a well defined collection of elements of same data type. In others words One can say that an array is grouping of some elements that are of same data type. Some applications of arrays in C are given below:

§ To store age of some boys.

§ To store marks of subjects.

§ To store daily rainfall data.

And so on.

Declaration of ARRAYS: ARRAY in C can be declared by following format

int array[50]; , float temperature[7];

See carefully that an array is declared by defining the data type first then the name and then the size of array.

Now a question should be come to reader’s mind and that is how can we take input of many elements at a time by using array? Answer of this question is very easy. This problem can be solved by using for loop for taking input by using following syntax.

For (i=0; i<n; i++)

Scanf (“%d”, &arr[i]);

Where n is the size of the array and arr is the name of array.

Now here a example is given to understand ARRAYS and the way of using an ARRAY in C.

#include<stdio.h>
int main()
{
int a[25],i,n,sum=0,mean;
printf("Enter the number of array elements\n");
scanf("%d",&n);
printf("Enter the value of array elements\n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
Printf(“%d ”, a[i]);
}
return 0;
}

There are two kinds of array those can be used in C language. One is ONE DIMENSIONAL and the other one is TWO DIMENSIONAL.

In this section we will discuss about only one dimensional array.

INITIALIZATION OF ONE DIMENSIONAL ARRAY: After declaring an array its elements can be initialized. Otherwise elements of array are of ‘garbage’. The following syntax can be used to initialize an array.

Data type variablename[size]={values};

Example : int student[3]={1,2,3};

Above example is called compile time initialization. Another type of initialization can be used for initialize an array. That is Run time initialization. For example take the following segment.

for(j=0;j<50;j++)

{

If(j<20)

A[i]=0.0;

Else

A[i]=1.0;

}

We can also use a scanf function to initialize an array as we discuss earlier with the answer of the question how to take input value of elements of an array.

The following example illustrates a sorting program in ascending order as an important application of arrays in C science.

/* a program to sort an array */
# include<stdio.h>
int main()
{
int a[25],i,j,n,temp,item;
char c;
printf("Enter the number of array elements\n");
scanf("%d",&n);
printf("Enter the value of array elements\n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
/* sorting of array */
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
printf("After sorting \n");
for(i=0;i<n;i++)
{
printf("%d ",a[i]);
}
}

Example of checking palindrome and prime number

2014-01-05T06:27:00.000-08:00

Here in this post we represent two basic C programming examples. Those example are only for the beginners.

v Check whether a number is palindrome or not through C program.

v Check whether a number is prime or not through C program.

Now the answers are given below:

Answer of no 1:

A number is said to be palindrome if the reverse of that number is same as the original number. Coding is given below…

/* C program to check whether a number is palindrome or not */
#include<stdio.h>
#include<stdlib.h>
int main()
{
   int n,t,rev=0;
printf("Give the value of of the number\n");
scanf("%d",&n);
t=n;
while(t!=0)
{
    rev=rev*10;
    rev=rev+t%10;
   t=t/10;
}
if(rev!=n)
printf("the entered number is not a palindrome\n");
else
printf("the entered number is palindrome number\n\n");
}

Answer of no 2:

A number is said to be prime if that number is only divisible by 1 and the number itself. Coding is given below…

/* C program to check whether a number is prime or not*/

#include<stdio.h>
int main()

{

int a,c=0,i,num;

printf("Give the value of num\n");

scanf("%d",&num);

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

{

a=num%i;

if(a==0)

{

c=c+1;

}

}

if(c==2)

printf("num is prime number");

else

printf("num is not a prime number");

}

Algorithm of Insertion Sort

2013-10-03T23:16:00.000-07:00

Written by Kousik :

This is another efficient way of solving a problem related with sorting. This algorithm works as the way people play cards. We present our procedure for insertion sort by the name INSERTION. This function takes an array of n element as input which is to be sorted. This algorithm sorts given n elements by inserting them into their right position.

Procedure INSERTION

{

For i=1 to n-1 do

Insert(i);

}

Insert(i)/* assumes a[0], a[1],…,a[i-1] are sorted*/

{ /* Insert a[i] in appropriate position so that a[0],a[1],…a[i-1],a[i] become sorted*/

}

Time complexity of this algorithm:

Look carefully in the algorithm you will see that the algorithm works for each element in the array by keeping a particular element into its right position. So the time complexity will be

T(n) =

=n(n+1)/2

<=n²/2=O(n²)

So it is efficient algorithm because it takes the polynomial time complexity for executing.

Now we have to write the C code for this algorithm

/* A c program for insertion sort*/

#include<stdio.h>

#include<stdlib.h>

int *a,n;

void insert();

int main()

{

int i;

printf("Enter the total number of elements: ");

scanf("%d",&n);

a=(int *)calloc(n,sizeof(int));

printf("Enter the values: ");

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

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

insert();

printf("The sorted array: ");

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

printf("%d ",a[i]);

return 0;

}

void insert(void)

{

int i,j,temp;

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

{

temp=a[i];

j=i-1;

while((temp<a[j])&&(j>=0))

{

a[j+1]=a[j];

j=j-1;

}

a[j+1]=temp;

}

Algorithm of Quicksort

2013-10-03T23:10:00.000-07:00

Written by Kousik :
QUICKSORT(S)

{

1. If ||S||<=1 return;

else {

2. Select a first element e as pivot from s.

3. Compare elements of s with e to partition S into subsets S₁, S₂, S₃such that

Elements of S₁ are less than e.

Elements of S₂are equal to e.

Elements of S₃are greater than e.

4. return (QUICKSORT(S₁), followed by S₂, QUICKSORT(S₃)) ;

}

Implementation of step 2 [Partitioning]

1) Select the very first element of S as pivot.(Simplest implementation)

2) Select pivot from S at random.(Randomized implementation)

Analysis of Time complexity of this algorithm:

Let T(n) be the time complexity of this algorithm.

i) Worst Case

T(n) = T(0) + T(n-1) + n -1

= 1+ T(n-1) + n -1

= T(n-1)+n

= n(n+1)/2 = O(n²)

This is a polynomial in time complexity. So this is a nice algorithm for solving a sorting problem. But we use this algorithm in a better way such that the time complexity of this algorithm reduced to O(nlogn).

ii) Best Case:

<- n/2 elements

->n/2 elements

Time complexity will be

T(n)=2T(n/2)+n

T(n)=O(nlogn)

iii) Average case:

[Assumption: all elements of S are equal probable to be the pivot in QUICKSORT(S)]

Let ith smallest element appear as pivot then

T(n)=n -1+T(i-1)+T(n-i)

=cn+T(i-1)+T(n-i)

Total time require by randomized quick sort algorithm is T(n).

T(n)=(1/n)

Assume T(0)=T(1)=b

Then T(n)=(1/n)

T(n)=(1/n)

= cn+(1/n)

= cn+(2/n)

= O(nlogn) [ for proof follow this book: Design and analysis of algorithm (aho: hofcroft: ullman)]

Now it is time for writing the average or randomized algorithm for quick sort.

Same procedure will be used in here except the method of pivot element.

QUICKSORT(S)

{

1. If ||S||<=1 return;

else {

2. select an element e as pivot from s in a random manner.

3. compare elements of s with e to partition S into subsets S₁, S₂, S₃such that

Elements of S₁ are less than e.

Elements of S₂are equal to e.

Elements of S₃are greater than e.

4. return (QUICKSORT(S₁), followed by S₂, QUICKSORT(S₃)) ;

}

See carefully at the line 2.

Before the pivot was the very first element but now it would be any element of s.

This is the big advantage of randomized quick sort algorithm.

Now we have to write the C code for randomized quick sort algorithm.

/* A program for randomized quick sort*/

#include<stdio.h>

#include<stdlib.h>

int *a,n;

void swap(int *a1,int *a2)/* function for swapping two element*/

{

int k;

k=*a1;

*a1=*a2;

*a2=k;

}

int partition(int i,int j)/* function for partition the array into three sub arrays*/

{

int x,p,v;

x=a[j];

p=i-1;

for(v=i;v<=j-1;v++)

{

if(a[v]<=x)

{

p++;

swap(a+p,a+v);

}

swap(&a[p+1],&a[j]);

return(p+1);

}

int rand_partition(int i,int j)/* function to finding the random number*/

{

int q;

q=rand()%(j-i)+i;

swap(a+q,a+j);

return partition(i,j);

}

void quicksort(int i,int j)/* function for main alogorithm QUICKSORT(S)*/

{

int b;

if(i<j)

{

b=rand_partition(i,j);

quicksort(i,b-1);

quicksort(b+1,j);

}

else

return;

}

void main()

{

int i;

printf("\n Enter the number of elements in the array: ");

scanf("%d",&n);

a=(int*)malloc(n*sizeof(int));

printf("\n Enter the elements in the array: ");

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

scanf("%d",a+i);

printf("\n The array before sorting is: ");

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

printf("%d ",a[i]);

quicksort(0,n-1);

printf("\n");

printf("\n The array after sorting is:");

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

printf(" %d",a[i]);

printf("\n");

return;

}
Continued...

Sorting

2013-10-03T23:03:00.000-07:00

Written by Kousik :

“Sorting”, this word must come when you are reading C programming language as well as algorithm. This is important part of C programming and very interested problem. Many algorithms for sorting are there. In this section we discuss about several sorting algorithms and their time and space complexity.

Definition:

Input: A sequence of n numbers from linearly ordered set or totally ordered set.

Output: A permutation of the given input sequence such that a[i] <=a[i+1] , where I =1,2,3…,n

Sorting algorithms:

There are many algorithms for sorting. Every algorithm took some time for performing. Different algorithms for same problem would take different complexity.

Problem: Sorting

Name of algorithms	Time complexity	Space Complexity
Insertion sort	O( )	O(n)
Bubble sort	O( )	O(n)
Quick sort	O(nlogn) (In Expected case)	O(n)
Heap sort	O(nlogn)	O(n)
Radix sort or bucket sort	O(n)	O(n)

Now we will analysis about the algorithms shown in above table:

Quick Sort:

This is a way of solving a problem related with sorting. This is a divide-conquer method for sorting. It works by following rule.

1) Partition the array into two parts.

2) Sort the two sub array.

3) Combine the solutions to get the solution for main problem.

Mainly the performance of this method depends upon the position where the partition is to be done. Partition can be done by three following ways.

1) At first or last position.(Worst case)

2) At middle position.(Best case)

3) Randomly choose an element for partition(Randomized quick sort)

We will call the partitioning element by name ‘PIVOT’.

After selecting pivot element we scan the whole array. If we find an element greater than or equal to the pivot element then we keep it at right side of pivot element and otherwise keep it in left side.

By doing this we can claim that the pivot element gets it right position into the array. Then we recursively call the function to right and left side. So, at the end we will get the sorted array.

First we select the middle element as pivot element.

Now it is the time for writing the algorithm.

Method: We use a function named QUICKSORT(S) which works recursively.

Input: Sequence S of n elements a_1,a₂...a_n

Output: The elements of S in sorted order.
Continued...

C Program for Merge Sort

2013-09-18T08:05:00.001-07:00

#include<stdio.h>
#include<stdlib.h>
int *a;
void m_sort(int,int);
void sort(int,int,int);

main()
{
int n,i;
printf("Enter the number of elements (it should be power of 2) ");
scanf("%d",&n);
a=(int *)calloc(n,sizeof(int));
printf("Enter the values ");
for(i=0;i<n;i++)
scanf("%d",a+i);
m_sort(0,n-1);
printf("The sorted array is \n");
for(i=0;i<n;i++)
printf("%d ",a[i]);
return;
}
void m_sort(int i,int j)
{
int mid;
if(j-i==0)
return;
else
{
mid=(i+j)/2;
m_sort(i,mid);
m_sort(mid+1,j);
sort(i,mid,j);
return;
}
}
void sort(int i,int mid,int j)
{
int *b,k,n,m;
n=i;
m=mid+1;
b=(int *)calloc((j+1),sizeof(int));
for(k=0;k<=j;k++)
{
if(n<=mid&&m<=j)
{
if(a[n]<a[m])
b[k]=a[n++];
else
b[k]=a[m++];
}
else if(n>mid)
b[k]=a[m++];
else
b[k]=a[n++];
}
for(k=0;k<=j;k++)
a[i++]=b[k];
return;
}

Example of Quick Sort

2013-09-17T02:04:00.001-07:00

Written by Wyes

#include<stdio.h>
#include<stdlib.h>
int *a;
void quicksort(int,int);
int partition(int,int);
void swap_w(int,int);
int random_partition(int,int);
int random_number(int,int);
main()
{
int i,j,n;
printf("Enter the number of elements ");
scanf("%d",&n);
a=(int *)calloc(n,sizeof(int));
printf("Enter the elements\n");
for(i=0;i<n;i++)
scanf("%d",a+i);
quicksort(0,n-1);
printf("The sorted sequence is\n");
for(i=0;i<n;i++)
printf("%d ",a[i]);
printf("\n");
return;
}
void quicksort(int i,int j)
{
int k;
if(j-i<1)
return;
else
{
k=random_partition(i,j);
quicksort(i,k-1);
quicksort(k+1,j);
return;
}
}
random_partition(int i,int j)
{
int k;
k=random_number(i,j);
swap_w(k,j);
return(partition(i,j));
}
int partition(i,j)
{
int m,n;
m=i-1;
for(n=i;n<j;n++)
{
if(a[n]<=a[j])
{
m++;
swap_w(m,n);
}
}
swap_w(m+1,j);
return(m+1);
}
int random_number(int i,int j)
{
return((rand()%(j-i))+i);
}
void swap_w(int i,int j)
{
int temp;
temp=a[i];
a[i]=a[j];
a[j]=temp;
return;
}

Example of bubble sort

2013-09-17T02:00:00.000-07:00

Written by Kousik

/* c program for bubble sort*/
#include<stdio.h>
int a[20];
void bubble(int n)
{
int t, i,j;
for(j=n-1;j>0;j++)
{
for(i=0;i<j;i++)
{
if(a[i+1]>a[i])
{
t=a[i];
a[i]=a[i+1];
a[i+1]=t;
}
}
}
}
int main()
{
int n,i;
printf("Enter the total number of elements: ");
scanf("%d",&n);
printf("Enter the values: ");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
bubble(n);
printf("The sorted sequence: ");
for(i=0;i<n;i++)
printf(" %d",a[i]);
return 0;
}

CONSTANTS,VARIABLES & KEYWORDS IN C

2013-08-12T22:07:00.000-07:00

Written by Kousik :
Every programming language has a grammar. Different programming language has different grammar. So to learn C programming language we have to be familiar with that grammar which is related to C program. The grammar is nothing but CONSTANTS, VARIABLES, & their DATA TYPES.

CONSTANTS:

There are two types of C constants. One is PRIMARY and other is SECONDARY.

Primary constants are of three types.

1) Integer Constant

2) Real Constant

3) Character Constant

Secondary constants are of several types.

1) Array

2) Pointer

3) Structure

4) Union

5) Enum etc…

Now we have to primary constants first…

Integer Constants:

Characteristics: a) An integer constants must have at least one digit. It must not have a decimal point.

b) It can either positive or negative. If no sign proceeds then the integer assumed to be positive.

c) The range for integer constants is -2147483648 to +2147483647. The range of integer constants is depend upon the compiler (visual studio, gcc , turbo c etc).

Example : 400, -421,+755 etc

Real Constants (Floating Point Constants):

Real constants can be shown in two forms. One is fractional form and other is exponential form.

Characteristics of Fractional form :

a) A real constants must have at least one digit . It must have a decimal point.

b) It can be either positive or negative. If no sign proceeds then the integer assumed to be positive.

c) No blanks are allowed within a real constant.

Example : -69.35 , 12.00 , +39.355 etc

In exponential form the real is represented in two major parts . The part coming before ‘e’ is called ‘mantissa’ and the part coming after ‘e’ called ‘exponent’ .

Characteristics of exponential form:

a) The word ‘e’ separate the exponential part and the mantissa part of real constants.

b) The mantissa part may have +ve or –ve sign. . If no sign proceeds then the integer assumed to be positive.

c) The exponent must have at least one digit.

d) Range = -3.4e38 to +3.4e38

Example: 3.2e-23, -0.45e+33 etc

Character Constants:

Characteristics:

a) A character constant can be a single alphabet, single digit or a single special symbol enclosed with single inverted commas.

b) The maximum length of a character constant is 1 character.

Example: ‘A’, ‘c’, ‘5’, ‘/’ etc

*Secondary constants will be discussed later.

VARIABLE:

To store the data value in computer memory we have to know about VARIABLES. Variables names are names given to location in memory. These locations can contain Integer, real, character constants .Type of variables are depending upon the type of constants. For example an integer type of variable can holds only the integer constants. The variable name is chosen by the programmer in such a way that shows its nature in the program.

Example: class, roll, count etc

Characteristics of variables:

a) They must begin with a letter.

b) A variable name is any combination of 1 to 31 alphabets, digits or underscores. The length of variables is depending upon the compiler.

c) No special symbol other than an underscore can be used in a variable name.

d) Uppercase and lowercase are very significant.

C KEYWORDS:

C compiler has some words whose meaning has already been explained. There are 32 keywords available in C. Different keywords have different meaning.

auto double int struct

Break else long switch

case enum register typedef

char extern return union

const float short unsigned

continue for signed void

default goto sizeof volatile

do if static while

To know more about c keywords you can follow LET UC C(by yashvant kanetkar) & ANSI C (by Balaguruswamy) .

Divide and Conquer : Explained with Example

2013-07-28T09:14:00.000-07:00

Written by Saikat :

DIVIDE AND CONQUER ALGORITHM:

The most commonly used & convenient algorithm is the 'Divide & conquer' algorithm. If a problem is tough to solve, then we can assume that this problem is made up by some small problems. Then we can break the main problem in some small sub-problems. Now we can easily solve the sub-problems. By this we can solve the whole problem very easily. This method is called Divide and Conquer method. By this method we can also develop efficient programs to solve a particular problem.

STEPS INVOLVED IN THIS ALGORITHM:

1) Divide the total problem into several sub problems of equal length.

2) Obtain the solution of the individual sub problems.

3) Combine the solutions to get the main solution.

ASPECT:

The basic aspect of this algorithm is to minimize the time complexity of a given problem as much as possible. There may be various types of algorithms to solve a particular problem. Among those we shall choose that one, which will take a polynomial order of time complexity, i.e. we will have to choose in such a way that it requires a least number of operations. It will be better if it takes time complexity of linear order.

EXAMPLE:

Take the example of the finding out the maximum and minimum from a set of integers. If we look the overall problem then we will face some challenges. So, just forget the whole problem. Now if there are two numbers then we can easily find out which is smaller and which is bigger by following algorithm.

If(a>b) then MAX <- a and MIN <- b

Else MAX <- b and MIN <- a

This is an easy problem to solve. So, we assume this problem as a unit problem and break the whole problem into sub problems.

Now look at the program and find out what we are doing in it.

#include<stdio.h>
#include<stdlib.h>

int *a;

typedef struct list
{
int min,max;
}ln;

ln minmax(int,int);
int min(int,int);
int max(int,int);

main()
{
int i,n;
ln ext;
printf("Enter the number of element ");
scanf("%d",&n);
a=(int *)calloc(n,sizeof(int));
printf("Enter the numbers ");
for(i=0;i<n;i++)
scanf("%d",(a+i));
ext=minmax(0,n-1);
printf("The minmum value is %d and the maximum value is %d",ext.min,ext.max);
return;
}

ln minmax(int n1,int n2)
{
ln ext,ext1,ext2;
if(n2-n1==1)
{
ext.min=min(a[n1],a[n2]);
ext.max=max(a[n1],a[n2]);
return ext;
}
else
{
ext1=minmax(n1,(n1+n2)/2);
ext2=minmax((n1+n2)/2+1,n2);
ext.min=min(ext1.min,ext2.min);
ext.max=max(ext1.max,ext2.max);
return ext;
}
}

int max(int a, int b)
{
if(a>b)
return a;
else
return b;
}

int min(int a, int b)
{
if(a<b)
return a;
else
return b;
}

Age Calculator Program

2013-07-25T00:03:00.001-07:00

Posted by Kousik

This is a program to calculate your age.

/*AGE CALCULATE*/
#include<stdio.h>
int main()
{
int dd,dm,dy,cd,cm,cy,d,m,y;
printf(“Enter your DATE OF BIRTH in dd mm yyyy format\n”);
scanf(“%d %d %d”,&dd,&dm,&dy);
printf(“Enter Current Date in dd mm yyyy format\n”);
scanf(“%d %d %d”,&cd,&cm,&cy);
y=cy-dy;
if(dm>cm)
{
y--;
m=12-(dm-cm);
if(dd>cd)
{
m--;
d=30-(dd-cd);
}
else
{
d=cd-dd;
}
}
else
{
m=cm-dm;
if(dd>cd)
{
m--;
d=30-(dd-cd);
}
else
{
d=cd-dd;
}
printf(“You AGE is \n”);
printf(“%d days %d months %d years\n”,d,m,y);
}

C program to turn binary number to decimal and decimal number to binary

2013-05-17T03:55:00.000-07:00

This is a program to convert binary to decimal

/* author- WYES KARNY */
#include<stdio.h>
int main()
{
int a,rem,des=0,i=1;
printf("Enter a binary number ");
scanf("%d",&a);
while(1)
{
rem=a%10;
a=a/10;
des+=rem*i;
i=i*2;
if(a==0)
break;
}
printf("\nThe equevalent desimal value is %d \n",des);
return 0;
}

And for the Decimal to binary

#include<stdio.h>
int main()
{
int a,i,shift,bit;
scanf("%d",&a);
for(i=0;i<16;i++)
{
shift=a<<i;
shift=shift>>15;
bit=shift&1;
if(bit==1)
printf("1");
else
printf("0");
}
}

Implement linked list

2013-05-10T22:45:00.000-07:00

Linked List is collection of data which is linked together in a specific way.
It is very efficient for computer memory. It consumes memory usage and save memory spaces.
It works as Dynamic Allocation System (DMA).
First we have to know -

What is Linked List?
Why we use Linked List?
How do we implement Linked list?

We will find answers for all of these questions.
I have given some introduction of linked list above but did not define yet.
Linked List is a list consisting element of structure type, which contains the data and link to the next element.
The picture can clear your confusion.

Here every block represents an element of the linked list. Every block contains two sub-blocks.

One block is for the data, saved in the element and other for the link to the next element.

Next question is, why we use it. Let us consider an example, in a school, there is a class consisting 50 students. If we save their marks in an array according to their roll numbers, then we have to declare an array of 50 elements. If we do this then when a new student gets admission, we have no space for the new student.

If we declare an array of 100 elements at first then it would be possible but it wastes a huge memory space.

Therefore in this case we can use Linked List.

Next, implementation of linked list,

Here is a program to implement linked list.

#include<stdio.h>

#include<stdlib.h>

typedef struct link_list

{

int number;

struct link_list *next;

}l;

void create(l *list);

void print_list(l* list);

main()

{

l *head;

head=(l*)malloc(sizeof(l));

create(head);

print_list(head);

}

void create(l *list)

{

char c;

printf("Enter the number\n");

scanf("%d",&list->number);

printf("continue... ");

getchar();

c=getchar();

if(c=='y')

{

list->next=(l*)malloc(sizeof(l));

create(list->next);

}

else

list->next=NULL;

}

void print_list(l* list)

{

if(list->next!=NULL)

{

printf("%d ",list->number);

print_list(list->next);

}

else

printf("%d\n",list->number);

}

(If you have any question, feel free to ask me)

A C Program to turn a infix expression into post-fix expression and evaluate the post-fix expression

2013-03-20T12:05:00.000-07:00

In Data Structures the program infix to post fix using stack is very important. There for here is an example for this program. Here we use a stack named stack to store in-stack elements.
/* This is a program to turn a infix expression into post-fix expression and then evaluate the expression */

#include<stdio.h>

#include<stdlib.h>

#include<string.h>

#include<ctype.h>

void push(char);

char pop();

int prt(char);

int eval(char *);

int top=-1;

char stack[30];

main()

{

int i=0,k=0;

char infix[30],postfix[30];

printf("Enter the expression ");

scanf("%s",infix);

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

{

if(isdigit(infix[i]))

postfix[k++]=infix[i];

else if(top==-1||prt(infix[i])>prt(stack[top]))

{

postfix[k++]=' ';

push(infix[i]);

}

else

{

while(prt(infix[i])<=prt(stack[top])&&top>-1)

postfix[k++]=pop();

push(infix[i]);

}

while(top>-1)

postfix[k++]=pop();

postfix[k]='\0';

printf("The postfix expression is %s\n",postfix);

printf("The result is %d\n",eval(postfix));

}

void push(char a)

{

stack[++top]=a;

return;

}

char pop()

{

return stack[top--];

}

int prt(char a)

{

if(a=='+'||a=='-') return 1;

else if(a=='*'||a=='/') return 2;

}

int eval(char *str)

{

int a[30],i,n=-1,j=0;

char temp[5];

for(i=0;str[i]!='\0';i++)

{

if(isdigit(str[i]))

temp[j++]=str[i];

else if(str[i]==' ')

{

temp[j]='\0';

a[++n]=atoi(temp);

j=0;

}

else

{

if(j!=0)

{

temp[j]='\0';

a[++n]=atoi(temp);

j=0;

}

if(str[i]=='+')

a[n-1]=a[n-1]+a[n];

else if(str[i]=='-')

a[n-1]=a[n-1]-a[n];

else if(str[i]=='*')

a[n-1]=a[n-1]*a[n];

else if(str[i]=='/')

a[n-1]=a[n-1]/a[n];

n--;

}

return a[0];

}

The output of this program......

Click here to download the program

A c program to implement the mod operation

2013-03-10T22:11:00.002-07:00

This is a program show the applications the mod (%) operation.

/*This is a program to input three digit number from user and display square of first and last number */
#include<stdio.h>
int main()
{
int num,rem,sqr1,sqr2;
start:
printf("Enter a three digit number ");
scanf("%d",&num);
if(num>999){
printf("\nSorry you have Entered long number\n");
goto start;
}
if(num<100){
printf("\nSorry you have entered short number\n");
goto start;
}
rem=num%10;
sqr2=rem*rem;
num=num/10;
num=num/10;
sqr1=num*num;
printf("\nThe square of the first digit is %d and the square of the last digit is %d \n",sqr1,sqr2);
return 0;
}

The output of this program ....

A C program to interchange small and capital letter alphabet

2013-03-09T05:18:00.003-08:00

In C every character has a ASCII number. Here we can use this concept for this program.
First we take a input from user. Then we check whether it is an alphabet or not and also check whether it is in capital or in small letter. If it is in capital then we add 32 with the character's ASCII value.
If it is in small letter then we subtract 32 from the character's ASCII value.
For your convenience here is the ASCII chart.

Now the the example ....

#include<stdio.h>
#include<ctype.h>
int main()
{
char c;
printf("Enter a alphabet ");
scanf("%c",&c);
if(isalpha(c))
{
if(c<'a')
{
c+=32;
printf("\nYou have entered capital letter\nThe corresponding small letter is %c\n",c);
}
else
{
c-=32;
printf("\nYou have entered small letter\nThe corresponding capital letter is %c\n",c);
}
}
return 0;
}

The output of this program will be....

C Program to interchange values without using a third variable

2013-03-08T19:59:00.001-08:00

We can inter change values with out using third variable.

//This is a program to interchange values of to number without using third variable

#include<stdio.h>
int main()
{
int a,b;
printf("Enter the frist number ");
scanf("%d",&a);
printf("\nEnter the scond number ");
scanf("%d",&b);
a=a*b;
b=a/b;
a=a/b;
printf("\nThe interchanged values are\nThe frist number is %d\nThe scond number is %d\n",a,b);
return 0;
}

The output will be.....

Program to swap values using third variable

2013-03-08T19:35:00.001-08:00

This is a simple program to swap the values using third variable.

//This is a program to interchange vaules of to number using thrid variable
#include<stdio.h>
int main()
{
int fst_num,snd_num,trd_num;
printf("Enter the frist number ");
scanf("%d",&fst_num);
printf("\nEnter the scond number ");
scanf("%d",&snd_num);
trd_num=fst_num;
fst_num=snd_num;
snd_num=trd_num;
printf("\nThe interchanged values are\nThe frist number is %d\nThe scond number is %d\n",fst_num,snd_num);
return 0;
}

The output of this program will be.....

Program to find out area of a circle

2013-03-08T19:29:00.001-08:00

This is a c program to find out the area of a circle.

#include<stdio.h>
#define PI 3.14
int main()
{
int redius;
float area;
printf("Enter the redius of the circle ");
scanf("%d",&redius);
area=PI*redius*redius;
printf("\nThe area of the circle is %5.2f\n",area);
return 0;
}

The out put will be....

Program to find out the square and cube of a number

2013-03-08T19:16:00.001-08:00

This is a example of simple program to find out the square and cube of a number.
This program can be extended to find out any power of a number using recursion function.

//This is a program to find out Square and Cube of a given number
#include<stdio.h>
int main()
{
int num,sqrt,cube;
printf("\nEnter a number to Square and Cube ");
scanf("%d",&num);
sqrt=num*num;
cube=num*num*num;
printf("\nThe Square of the give number is %d\nand the cube of the give number is %d",sqrt,cube);
return 0;
}

Datatypes & Variables in C

2013-02-20T23:12:00.001-08:00

Introduction to Data Types:

For learning C programming we have to familiar with several types of data.

There are five fundamental datatypes,which are all supported in any c compilers.

They are

1) Integer (int) - for integer type data.

2) Float (float) - for floating point number.

3) Character (char) - for a single character. (included spacial character)

4) Double (double) - for a huge floating point number.

5) Void (void) - for a void type variable.

We can derive some other data type from these five fundamental datatypes.

these derived datatypes are short integer,signed integer, unsigned integer etc.

Integer:

1. signed int 1. unsigned int

2. signed short int 2. unsigned short int

3. signed long int 3. unsigned long int

Character: Float:

1. char 1. float

2. signed char 2. double

3. unsigned char 3. long double

Now one thing is to be remembered. The range of several data type depends upon compiler.

i.e: For a 16 bit compiler the range of an integer constant is -32768 to +32767.

for a 32 bit compiler this range is -2147483648 to +2147483647.

Size of data types is also depend upon compiler.

Compiler short Int long

16 bit 2 2 4

32 bit 2 4 4

Introduction

2013-02-16T03:28:00.001-08:00

The word C has spacial meaning to every programmer. C is a programming language developed by Dennis Ritchie at AT & T's Bell Laboratories.

Easy Ways to Learn C Programming

2013-02-16T03:05:00.000-08:00

Here you can learn C Programming in a easy way.
You can master C Programming within one and a half months if you learn form here.
We'll clear your concepts and teach you to how to think like computer scientist.
After every topic we will give you a assignment set to solve it yourself .
And for solving it we will give you some algorithms.