EmbLogic's Blog

#include
int main()
{
int n,i,a[10]={1,2,3};
printf(“enter element you want to add:”);
scanf(“%d”,&n);
for(i=9;i>=0;i–)
{
a[i]=a[i-1];
if(i==0)
a[i]=n;
// printf(“a[%d]=%d\n”,i,a[i]);
}
printf(“After adding element:\n”);
for(i=0;i<9;i++)
{
printf("a[%d]=%d\n",i,a[i]);
}
}

#include
int main()
{
int i,j,k,a[100],n;
printf(“Enter size of array:”);
scanf(“%d”,&n);
printf(“Enter element of an array:”);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
for(j=0;ja[j+1])
{
k=a[j];
a[j]=a[j+1];
a[j+1]=k;
}
}
}
printf(“Array after bubble sorting:\n”);
for(i=0;i<n;i++)
{
printf("a[%d]=%d\n",i,a[i]);
}
}

1 #include<stdio.h>
2 void main()
3 {
4                 int i,j,n,n1,n2;
5
6
7         printf(“\n\nenter the number of values u will enter : “);
8
9 scanf(“%d”,&n1);
10
11                int a[n1];
12
13         printf(“\nnow enter values of elements : \n”);
14
15
16                         for(i=0;i<n1;i++)
17                         {
18                                 scanf(“%d”,&a[i]);
19                         }
20
21         printf(“\nnow enter the number of value u want to insert in an array :”);
22
23 scanf(“%d”,&n2);
24
25                 int b[n2];
26
27
28         printf(“\nnow enter the elements u want to insert in an array : \n”);
29
30
31                         for(i=0;i<n2;i++)
32                         {
33                                 scanf(“%d”,&b[i]);
34                         }
35
36
37
38                         n=n1+n2;
39
40                           int c[n];
41
42
43                                 for(i=0;i<n1;i++)
44                                 {
45                                         c[i]=a[i];
46                                 }
47
48
49
50
51
52                                                 for(j=n-1;j>1;j–)
53                                                 {
54                                                         c[j]=c[j-n2];
55
56                                                 }
57
58
59
60         for(i=0;i<n2;i++)
61         {
62                 c[i]=b[i];
63         }
64
65                                 printf(“\nnow the array is : \n”);
66
67
68                 for(i=0;i<n;i++)
69                 {
70                         printf(“%d\n”,c[i]);
71                 }
72
73
74 }

#include<stdio.h>
int main()
{
int i,j,b,k,n,l;

printf(“\n\nenter the number of values u will enter : “);
scanf(“%d”,&n);

int a[n];

printf(“\nnow enter the elements : \n”);

for(l=0;l<n;l++)
{
scanf(“%d”,&a[l]);
}
for(i=0;i<n;i++)
{
for(j=0;j<n-1;j++)
{
if(a[j]>a[j+1])
{
b=a[j];
a[j]=a[j+1];
a[j+1]=b;
}
}
}
for(k=0;k<n;k++)
{
printf(“\n%d”,a[k]);
}
}

LINK LIST creation, traversal, insertion(all options) and deletion(all options) completed.
RCS file: ll.c,v
Working file: ll.c
head: 1.7
branch:
locks: strict
root: 1.7
access list:
symbolic names:
keyword substitution: kv
total revisions: 7;    selected revisions: 7
description:
SINGLY LINKED LIST
—————————-
revision 1.7    locked by: root;
date: 2014/07/06 14:31:05;  author: root;  state: Exp;  lines: +83 -16
delete_nth() and delete_key() functions implemented.
minor chnages in printf statements.
—————————-
revision 1.6
date: 2014/07/06 13:12:56;  author: root;  state: Exp;  lines: +44 -8
Implemented delete_end().
Added “deletion node possible” alert in delete_beg().
—————————-
revision 1.5
date: 2014/07/06 12:47:08;  author: root;  state: Exp;  lines: +52 -3
Implemented delete_beg().
—————————-
revision 1.4
date: 2014/07/04 18:26:28;  author: root;  state: Exp;  lines: +48 -10
Implemented insert_key(); i.e. a function to insert node after a key value location.
Also entered condition checking in insert_nth().
—————————-
revision 1.3
date: 2014/07/04 16:59:48;  author: root;  state: Exp;  lines: +84 -39
Implemented function to insert node at the beginning of link list and also a function to insert after nth node.
—————————-
revision 1.2
date: 2014/07/04 07:32:04;  author: root;  state: Exp;  lines: +1 -1
creation of link list, insertion at beginning and traversal have been implemented.
—————————-
revision 1.1
date: 2014/07/04 07:16:00;  author: root;  state: Exp;
Initial revision
=============================================================================

#include
int main()
{
int area,triangle,side,base,height;
char ch;
printf(“Enter s for area and t for triangle:”);
scanf(“%c”,&ch);
switch(ch)
{
case ‘s’:
printf(“Enter side:”);
scanf(“%d”,&side);
area=side*side;
printf(“Area of square = %dm^2\n”,area);
break;
case ‘t’:
printf(“Enter base and hight:”);
scanf(“%d%d”,&base,&height);
area=(base*height)/2;
printf(“Area of triangle =%dm^2\n”,area);
}

}

#include
int main()
{
int i,a[10],b[10],c[10];
printf(“Enter the element of array1:\n”);
for(i=0;i<10;i++)
{
scanf("%d",&a[i]);
}
printf("Enter the element of array2:\n");
for(i=0;i<10;i++)
{
scanf("%d",&b[i]);
}
printf("Element of array3 are:\n");
for(i=0;i<10;i++)
{
c[i]= a[i]+b[i];
printf("a[%d]+b[%d]=%d\n",i,i,c[i]);
}
}

#include

int main()
{
int sec=0,min=0,hour=0,i,j;
while(1)
{

if(sec>59)
{
min++;
sec=0;
}
if(min>59)
{
hour++;
min=0;
}
if(hour>23)
{
hour=0;
min=0;
sec=0;
}
sleep(1);
sec=sec+1;
system(“clear”);
printf(“\t\t%d:%d:%d\n”,hour,min,sec);

}
}