Check whether given number is palindrome or not

August 27, 2013 admin

Approach :

store the given number into some other variable then reverse the number and compare it with stored no. If both the numbers are same then the given number is palindrome.

Example :

Given No Reversed No Equal Palindrome

123 321 No No

121 121 Yes Yes

————————————————————————————————————————————————————————–

C code to check whether given number is palindrome or not.

#include<stdio.h>
void palindrome(int n){
int revno=0,r,s=n;
while(n>0){
   r=n%10;
   revno=revno*10+r;
   n=n/10;
}
   if(revno==s)
       printf(" %d is a palindrome  number",s);
   else
    printf(" %d is not a palindrome number",s);
}
int main()
{
int n;
printf("Enter the number :");
scanf("%d",&n);
palindrome(n);
return 0;
}

#include<stdio.h>

void palindrome(int n){

int revno=0,r,s=n;

while(n>0){

r=n%10;

revno=revno*10+r;

n=n/10;

}

if(revno==s)

printf(" %d is a palindrome number",s);

else

printf(" %d is not a palindrome number",s);

}

int main()

{

int n;

printf("Enter the number :");

scanf("%d",&n);

palindrome(n);

return 0;

}

Code provided by Lalit Kumar

C Array, play with numbers

Print given square matrix in spiral order

August 26, 2013 admin

Print givensquare matrix in spiral order :

Complexity : O(n^2)

Approach :

Step1 : write a 4 for loop for printing boundry

step 2: Apply the step1 for inner martrix by modifying starting point and ending point of matrix

step 3: Aplly step2 untill the matrix size becomes 1 or 0

end

Input :

—————-

1 2 3 4

12 13 14 5

11 16 15 6

10 9 8 7

—————-

Output :

——————————————————-

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

——————————————————-

C code to print given square matrix in spiral order :

#include<stdio.h>
void print_array_spiral(int A[][4],int i,int j,int l,int m,int n)
{
    if(n<=0) return;
    if(n==1)
    {
        printf(" %d ",A[i][j]);
	return;
    }
    int ii=i,jj=j,ll=l,mm=m;
    // Loop 1 to print top Row
    for(jj=j;jj<=m;jj++)
        printf(" %d ",A[ii][jj]);
    jj=m;
    // Loop 2 to print Right most column array
    for(ii=i+1;ii<=l;ii++)
	printf(" %d ",A[ii][jj]);
    ii=l;
    // Loop 3 to print bottom Row
    for(jj=m-1;jj>=i;jj--)
        printf(" %d ",A[ii][jj]);
    jj=i;
    // Loop 4 to print Left most column
    for(ii=l-1;ii>=i+1;ii--)
	printf(" %d ",A[ii][jj]);
print_array_spiral(A,i+1,j+1,l-1,m-1,n-2);
}
int main(){

int Arr[][4]={{1,2,3,4},{12,13,14,5},{11,16,15,6},{10,9,8,7}};

print_array_spiral(Arr,0,0,3,3,4);

return 0;
}

#include<stdio.h>

void print_array_spiral(int A[][4],int i,int j,int l,int m,int n)

{

if(n<=0) return;

if(n==1)

{

printf(" %d ",A[i][j]);

return;

}

int ii=i,jj=j,ll=l,mm=m;

// Loop 1 to print top Row

for(jj=j;jj<=m;jj++)

printf(" %d ",A[ii][jj]);

jj=m;

// Loop 2 to print Right most column array

for(ii=i+1;ii<=l;ii++)

printf(" %d ",A[ii][jj]);

ii=l;

// Loop 3 to print bottom Row

for(jj=m-1;jj>=i;jj--)

printf(" %d ",A[ii][jj]);

jj=i;

// Loop 4 to print Left most column

for(ii=l-1;ii>=i+1;ii--)

printf(" %d ",A[ii][jj]);

print_array_spiral(A,i+1,j+1,l-1,m-1,n-2);

}

int main(){

int Arr[][4]={{1,2,3,4},{12,13,14,5},{11,16,15,6},{10,9,8,7}};

print_array_spiral(Arr,0,0,3,3,4);

return 0;

}

C Array, play with numbers

find pair of numbers in array that add to given sum

August 26, 2013 admin

Find pair of numbers in array that add to given sum :

Complexity: O(n logn)

Approach :

step 1: Sort an array using efficient sorting method

step 2: use two variable i & j , initialize i as starting position of array (i=0) and j as last position of array (j=n-1). Where n is number of element in array.

step 3: if(A[i]+A[j]<x) i++

else if(A[i]+A[j]>x) j–

else (A[i]+A[j]==x) print A[i] , A[j] and i++

step 4: Repeat step 3 untill i<j

Code to Find pair of numbers in array that add to given sum :

#include<stdio.h>
void swap(int *p,int *q){
int t;
t=*q;
*q=*p;
*p=t;
}
int partition(int [],int ,int);
void quicksort(int A[],int p,int r){
    int q;
    if(p<r){
        q=partition(A,p,r);
        quicksort(A,p,q-1);
        quicksort(A,q+1,r);
    }
}
int partition(int A[],int p,int r){
int x,i,j;
x=A[r];
i=p-1;
for(j=p;j<r;j++){
    if(A[j]<=x){
        i=i+1;
        swap(&A[i],&A[j]);
        }
}
swap(&A[i+1],&A[r]);
return i+1;
}

void sum_of_pair_as_x(int A[],int n,int x){
   int i=0,j=n-1;
    while(j>i){
        if(A[i]+A[j]<x) i++;
        else if(A[i]+A[j]>x) j--;
        else {printf(" [ %d ,%d ] ",A[i],A[j]); i++;}
    }
}

void print_array(int A[],int n){
    int i=0;
    for(i=0;i<n;i++)
        printf(" %d ",A[i]);
printf("\n");
}
int main()
{
    int Arr[]={7,8,3,1,2,4,6,5};
    int x=9;
    int n=sizeof(Arr)/sizeof(Arr[0]);
    quicksort(Arr,0,n-1);
    printf("\n Pair of sum %d are : \n",x);
    sum_of_pair_as_x(Arr,n,x);
    printf("\n");
 return 0;
}

#include<stdio.h>

void swap(int *p,int *q){

int t;

t=*q;

*q=*p;

*p=t;

}

int partition(int [],int ,int);

void quicksort(int A[],int p,int r){

int q;

if(p<r){

q=partition(A,p,r);

quicksort(A,p,q-1);

quicksort(A,q+1,r);

}

int partition(int A[],int p,int r){

int x,i,j;

x=A[r];

i=p-1;

for(j=p;j<r;j++){

if(A[j]<=x){

i=i+1;

swap(&A[i],&A[j]);

}

swap(&A[i+1],&A[r]);

return i+1;

}

void sum_of_pair_as_x(int A[],int n,int x){

int i=0,j=n-1;

while(j>i){

if(A[i]+A[j]<x) i++;

else if(A[i]+A[j]>x) j--;

else {printf(" [ %d ,%d ] ",A[i],A[j]); i++;}

}

void print_array(int A[],int n){

int i=0;

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

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

printf("\n");

}

int main()

{

int Arr[]={7,8,3,1,2,4,6,5};

int x=9;

int n=sizeof(Arr)/sizeof(Arr[0]);

quicksort(Arr,0,n-1);

printf("\n Pair of sum %d are : \n",x);

sum_of_pair_as_x(Arr,n,x);

printf("\n");

return 0;

}

C Array, Sorting

Counting sort

August 24, 2013 admin

Counting Sort :

n is number of values in array , k is the range of values (max – min )

Compexity : O(n+k)

Counting sort is a sorting technique to sort an array in linear time. It uses an extra space for counting occurrence of each object in array. This technique is efficient when range of data is not much larger than number of inputs to be sorted.

/* Counting Sort Code by codingstreet.com
Complexity: O(n+k);
n is number of object in the array
k is range of input
*/
#include<stdio.h>
#include<stdlib.h>

void printarray(int A[],int size){
    int i;
    printf("\n ");
    for(i=0;i<size;i++)
        printf("%d ",A[i]);
}

void counting_sort(int A[],int size){
int min,max,i,range,*p,j;
min=A[0],max=A[0];
    for(i=0;i<size;i++){
            if(A[i]<min) min=A[i];
            if(A[i]>max) max=A[i];
    }
range=max-min+1;
p=malloc(sizeof(int)*range);
    for(i=0;i<range;i++) p[i]=0;

    for(i=0;i<size;i++){
        p[A[i]-min]+=1;
    }
    int k=0;
    /* First Fore loop is executed 'range' times and second while loop wil be executed only 'size' */ 
    for(i=0;i<range;i++){
	j=p[i];    	
	while(p[i]!=0 && j!=0){
	A[k]=i+min;
	k++;
	j--;      
	}
    }
}
int main(){

int A[]={5,9,8,6,15,11,7,5,8};

int n=sizeof(A)/sizeof(A[0]);
// Array Before Sorting
printarray(A,n);
counting_sort(A,n);
// Array After counting Sort
printarray(A,n);

return 0;
}

/* Counting Sort Code by codingstreet.com

Complexity: O(n+k);

n is number of object in the array

k is range of input

#include<stdio.h>

#include<stdlib.h>

void printarray(int A[],int size){

int i;

printf("\n ");

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

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

}

void counting_sort(int A[],int size){

int min,max,i,range,*p,j;

min=A[0],max=A[0];

for(i=0;i<size;i++){

if(A[i]<min) min=A[i];

if(A[i]>max) max=A[i];

}

range=max-min+1;

p=malloc(sizeof(int)*range);

for(i=0;i<range;i++) p[i]=0;

for(i=0;i<size;i++){

p[A[i]-min]+=1;

}

int k=0;

/* First Fore loop is executed 'range' times and second while loop wil be executed only 'size' */

for(i=0;i<range;i++){

j=p[i];

while(p[i]!=0 && j!=0){

A[k]=i+min;

k++;

j--;

}

int main(){

int A[]={5,9,8,6,15,11,7,5,8};

int n=sizeof(A)/sizeof(A[0]);

// Array Before Sorting

printarray(A,n);

counting_sort(A,n);

// Array After counting Sort

printarray(A,n);

return 0;

}

C Array, Sorting

Kth smallest element in Array

August 22, 2013 admin

C code to find out Kth smallest element in array .

Approach 1:

Sort the array using any sorting method and return the value of kth index.

Approach 2:

Using partition function of quick sort which return the index of the pivot value.

comparing the returning value from partition function with k.

/* C code to find Kth smallest element in array */
#include<stdio.h>
int partition(int A[],int,int );
void  swap(int *a,int *b){
int t=*a;
*a=*b;
*b=t;
}

/* n is total no of element in array , k is for kth smallest element */
int kthsmallest(int  A[],int n, int k){
int i=0,flag=0;
int p,q,r;
p=0;
r=n-1;
k--;
while(!flag){
    q=partition(A,p,r);
    if(q==k) flag=1;
    else if(k<q){ r=q-1;}
    else {p=q+1;}
}
return A[k];
}
int partition(int A[],int p,int r){
int i,j,pivot;
i=p-1;
pivot=A[r];
for(j=p;j<r;j++){
   if(A[j]<pivot){
        i++;
        swap(&A[j],&A[i]);
   }
}
swap(&A[i+1],&A[r]);
return i+1;
}
int main(){

int Arr[]={5,-4,3,-2,1};
int result;
result=kthsmallest(Arr,5,2);

printf(" %d ",result);

return 0;
}

/* C code to find Kth smallest element in array */

#include<stdio.h>

int partition(int A[],int,int );

void swap(int *a,int *b){

int t=*a;

*a=*b;

*b=t;

}

/* n is total no of element in array , k is for kth smallest element */

int kthsmallest(int A[],int n, int k){

int i=0,flag=0;

int p,q,r;

p=0;

r=n-1;

k--;

while(!flag){

q=partition(A,p,r);

if(q==k) flag=1;

else if(k<q){ r=q-1;}

else {p=q+1;}

}

return A[k];

}

int partition(int A[],int p,int r){

int i,j,pivot;

i=p-1;

pivot=A[r];

for(j=p;j<r;j++){

if(A[j]<pivot){

i++;

swap(&A[j],&A[i]);

}

swap(&A[i+1],&A[r]);

return i+1;

}

int main(){

int Arr[]={5,-4,3,-2,1};

int result;

result=kthsmallest(Arr,5,2);

printf(" %d ",result);

return 0;

}

binary search tree, C Code, Tree

C program to calculate size of binary tree

August 18, 2013 admin

Problem statement :

Given a Binary tree write a c program to calculate size of binary tree

Explanation :

Size of Binary tree is defined as total no of nodes in binary tree.

Solution :

Applying recursive approach

if root is NULL then size is zero

else size of left subtree ,right subtree and +1 for the root node.

int size_of_bst(struct Tnode *Troot){
    if(Troot==NULL) return 0;
    else {
        return (size_of_bst(Troot->left)+1+size_of_bst(Troot->right));
    }
}

int size_of_bst(struct Tnode *Troot){

if(Troot==NULL) return 0;

else {

return (size_of_bst(Troot->left)+1+size_of_bst(Troot->right));

}

Click here to get binary search tree implementation code.

binary search tree, C Code, Tree

Find max depth of Binary tree

August 18, 2013 admin

Problem Statement :

Given a binary tree find the max depth of Binary Tree.

Solution :

Height of binary tree defined as max path length from root to leaf node. if root is NULL then height is defined as zero. Here we can apply recursive approach as maximum of height of left subtree and right subtree with +1 value of root node .

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

int maxdepth(struct Tnode *Troot){
    if(Troot==NULL) return 0;
    else {
        return max(maxdepth(Troot->left),maxdepth(Troot->right))+1;
    }
}

int max(int a,int b){

if(a>b) return a;

else return b;

}

int maxdepth(struct Tnode *Troot){

if(Troot==NULL) return 0;

else {

return max(maxdepth(Troot->left),maxdepth(Troot->right))+1;

}

Click here to get binary search tree implementation code.

C Code

create csv file in c

August 16, 2013 admin

A .CSV Comma Separated Values is a file which contains tabular data in form of text. We can separate each cell in table by representing comma (,) in .csv format.

Here is the c program to represent 2D array into csv format.

This code creates a csv file and stores info of 2D array which contains marks of 3 subjects (Physics , chemistry , maths ) along with student id.

C code to create csv file in c

#include&lt;stdio.h&gt;

#include&lt;string.h&gt;

void create_marks_csv(char *filename,int a[][3],int n,int m){

printf("\n Creating %s.csv file",filename);

FILE *fp;

int i,j;

filename=strcat(filename,".csv");

fp=fopen(filename,"w+");

fprintf(fp,"Student Id, Physics, Chemistry, Maths");

for(i=0;i&lt;m;i++){

    fprintf(fp,"\n%d",i+1);

    for(j=0;j&lt;n;j++)

        fprintf(fp,",%d ",a[i][j]);

    }

fclose(fp);

printf("\n %sfile created",filename);

}

int main(){

    int a[3][3]={{50,50,50},{60,60,60},{70,70,70}};

    char str[100];

    printf("\n Enter the filename :");

    gets(str);

create_marks_csv(str,a,2,3);

return 0;

}

#include<stdio.h>

#include<string.h>

void create_marks_csv(char *filename,int a[][3],int n,int m){

printf("\n Creating %s.csv file",filename);

FILE *fp;

int i,j;

filename=strcat(filename,".csv");

fp=fopen(filename,"w+");

fprintf(fp,"Student Id, Physics, Chemistry, Maths");

for(i=0;i<m;i++){

fprintf(fp,"\n%d",i+1);

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

fprintf(fp,",%d ",a[i][j]);

}

fclose(fp);

printf("\n %sfile created",filename);

}

int main(){

int a[3][3]={{50,50,50},{60,60,60},{70,70,70}};

char str[100];

printf("\n Enter the filename :");

gets(str);

create_marks_csv(str,a,2,3);

return 0;

}

C Code

C code to draw indian flag

August 15, 2013 admin

Indian flag drawing code :

C Code to draw indian flag

 #include<stdio.h>
#include<graphics.h>
int main(){
int gd=DETECT,gm;
initgraph(&gd,&gm,NULL);
setcolor(BLUE);
bar(70,100,100,400);
setcolor(RED);
bar(100,100,200,150);
setcolor(WHITE);
bar(100,150,200,200);
setcolor(BLUE);
circle(150,175,25);
setcolor(GREEN);
bar(100,200,200,250);
setcolor(LIGHTGRAY);
bar(50,400,125,420);
getchar();
return 0;
}

#include<stdio.h>

#include<graphics.h>

int main(){

int gd=DETECT,gm;

initgraph(&gd,&gm,NULL);

setcolor(BLUE);

bar(70,100,100,400);

setcolor(RED);

bar(100,100,200,150);

setcolor(WHITE);

bar(100,150,200,200);

setcolor(BLUE);

circle(150,175,25);

setcolor(GREEN);

bar(100,200,200,250);

setcolor(LIGHTGRAY);

bar(50,400,125,420);

getchar();

return 0;

}

Codingstreet

Check whether given number is palindrome or not

Print given square matrix in spiral order

find pair of numbers in array that add to given sum

Counting sort

Kth smallest element in Array

C program to calculate size of binary tree

Find max depth of Binary tree

create csv file in c

C code to draw indian flag

A place to brush your coding skills