#include<stdio.h> #include<conio.h> void main() { int a[50],*p,i,n; clrscr(); p=a; printf(“Enter size of array:”); scanf(“%d”,&n); printf(“Enter elements of array:”); for(i=0;i<n;++i) scanf(“%d”,p+i); for(i=0;i<n;++i) printf(“%d “,*(p+i)); getch(); }
Hello friends, this is first time that i am writing about gadgets. I hope you will all like this article. In this article i have compiled some tablets with good performance and very low price. So just take a look on them and let me know which one you like by commenting below. Also Read: The …
Top 5 Cheapest Android Tablets below Rs. 5000 in India in 2013 Read More »
There are so many misunderstandings among common man about technology. If these misunderstandings are removed then it may help us to became more techno friendly. Some people think that computer monitor causes cancer. While some other think that there email account is password protected and it can not be hacked. But most of these things …
The 5 Biggest Tech Myths Prevailing Among Common Man Read More »
Here is the C program to find the largest and smallest element in a one-dimensional (1-D) array. Output How many elements:5Enter the Array:1 8 12 4 6The largest element is 12The smallest element is 1 Explanation: The program starts by declaring an integer array ‘a’ of size 50 elements, along with integer variables ‘i’, ‘n’, …
C Program to Find Largest and Smallest Number in an Array Read More »
Here you will find program for matrix addition in C. Two matrix can be added only when number of rows and columns of first matrix is equal to number of rows of columns of second matrix. Matrix Addition in C #include<stdio.h> int main() { int a[5][5],b[5][5],c[5][5],i,j,m,n; printf(“How many rows and columns?”); scanf(“%d%d”,&m,&n); printf(“\nEnter first matrix:\n”); …
Here you will learn about program for bubble sort in C. Bubble sort is a simple sorting algorithm in which each element is compared with adjacent element and swapped if their position is incorrect. It is named as bubble sort because same as like bubbles the lighter elements come up and heavier elements settle down. …
#include<graphics.h> #include<dos.h> void main() { int gd=DETECT,gm,i; initgraph(&gd,&gm,”c:\turboc3\bgi”); for(i=0;i<=360;++i) { circle(300,200,80); pieslice(300,200,0,i,80); outtextxy(200,320,”Loading….Please Wait!”); delay(20); } closegraph(); }
#include<graphics.h> #include<conio.h> #include<dos.h> void main() { int gdriver=DETECT,gmode,i=0,j=0; initgraph(&gdriver,&gmode,”c:\turboc3\bgi”); for(i;i<420;++i) { line(0,245,650,245); line(0+i,200,210+i,200); line(50+i,200,70+i,170); line(70+i,170,140+i,170); line(140+i,170,160+i,200); line(85+i,170,85+i,200); line(125+i,170,125+i,200); line(0+i,200,0+i,230); line(210+i,200,210+i,230); line(0+i,230,50+i,230); circle(65+i,230,15); line(80+i,230,130+i,230); circle(145+i,230,15); line(210+i,230,160+i,230); pieslice(65+i,230,359-j,360-j,15); pieslice(65+i,230,179-j,180-j,15); pieslice(65+i,230,89-j,90-j,15); pieslice(65+i,230,269-j,270-j,15); pieslice(145+i,230,359-j,360-j,15); pieslice(145+i,230,179-j,180-j,15); pieslice(145+i,230,89-j,90-j,15); pieslice(145+i,230,269-j,270-j,15); if(j==179) j=0; ++j; delay(30); cleardevice(); } closegraph(); }
