Scribd
Upload
8 views

Array For Dsa Codes

Uploaded by

mandarphotos27
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

Array For Dsa Codes

Uploaded by

mandarphotos27
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

1] traversal visiting every element once

#include <stdio.h>
int main()
{
int a[50];
int size,i;
printf("enter size of array:");
scanf("%d",&size);
if(size>50)
{
printf("overflow condition");
}
else
{
printf("enter elements of array:");
}
for(i=0;i<size;i++)
{
scanf("%d",&a[i]);
}
printf("elements are:");
for(i=0;i<=size-1;i++)
{
printf("%d\n",a[i]);
}
return 0;
}

2] insertion code at any position.

#include <stdio.h>
int main()
{
int a[50];
int size,i,pos,num;
printf("enter size of array:");
scanf("%d",&size);
if(size>50)
{
printf("overflow condition");
}
else
{
printf("enter elements of array:");
}
for(i=0;i<size;i++)
{
scanf("%d",&a[i]);
}
printf("enter the number to be inserted and its position:");
scanf("%d%d",&num,&pos);
if(pos<0 || pos>size+1)
{
printf("invalid position for insertion");
}
else
{
for(i=size;i>=pos-1;i--)
{
a[i+1]=a[i];
}
a[pos-1]=num;
size++;
printf("elements are:\n");
for(i=0;i<=size-1;i++)
{
printf("%d\n",a[i]);
}
}

return 0;
}

3]insertion code at begining use little brain

no need to take pos


for(i=size;i=0;i--)
{
a[i+1]=a[i];
}
a[0]=num;
size++;

4]insertion code at end

a[size]=num;
size++;

5] deletion at any position

#include <stdio.h>
int main()
{
int a[50];
int size,i,pos,num;
printf("enter size of array:");
scanf("%d",&size);
if(size>50)
{
printf("overflow condition");
}
else
{
printf("enter elements of array:");
}
for(i=0;i<size;i++)
{
scanf("%d",&a[i]);
}
printf("enter the position for deletion:");
scanf("%d",&pos);
if(pos<0 || pos>size)
{
printf("invalid position");
}
else
{
for(i=pos-1;i<=size;i++)
{
a[i]=a[i+1];
}
size--;
printf("elements are:\n");
for(i=0;i<=size-1;i++)
{
printf("%d\n",a[i]);
}
}
return o;
}

6]deletion at first position

#include <stdio.h>

int main()
{
int a[50];
int size,i,pos,num;
printf("enter size of the array:");
scanf("%d",&size);
if(size<=0 || size>50)
{
printf("overflow condition");
}
else
{
printf("enter elements of the array:");
for(i=0;i<=size-1;i++)
{
scanf("%d",&a[i]);
}
printf("elements of array are:\n");
for(i=0;i<=size-1;i++)
{
printf("%d\n",a[i]);
}
// printf("enter pos for deletion:");
// scanf("%d",&pos);
for(i=0;i<=size-1;i++)
{
a[i]=a[i+1];
}

size--;
}
printf("elements of array after deletion are:\n");
for(i=0;i<=size-1;i++)
{
printf("%d\n",a[i]);
}
printf("size after insertion is:%d",size);

return 0;
}

7] Revarsal of an array

#include <stdio.h>
int main()
{
int a[50];
int size,i;
printf("enter size of array:\n");
scanf("%d",&size);
if(size<0 || size>50)
{
printf("overflow condition");
}
else
{
printf("enter elements of array:\n");
for(i=0;i<=size-1;i++)
{
scanf("%d",&a[i]);
}
printf("elements are:\n");
for(i=0;i<=size-1;i++)
{
printf("%d\n",a[i]);
}
printf("elements after reversal are:\n");
for(i=size-1;i>=0;i--)
{
printf("%d\n",a[i]);
}

}
return 0;
}

8]about pointers two methods to print value and address

#include <stdio.h>

int main()
{
int *ptr;
int a=10;
ptr=&a;
printf("value of a is:%d\n",a);
printf("value of a is:%d\n",*ptr);
printf("size of a is:%p\n",&a);
printf("size of a is:%p\n",ptr) ;
return 0;
}

some more

#include <stdio.h>
int main()
{
int *ptr;
int a[]={6,3,4,2.9};
ptr=a;
printf("address of a is:%p\n",a);
printf("address of a is:%p\n",ptr);
ptr++; //ptr was storing a[0] address on ptr++ now it stores a[1] address
printf("address of a[1] is%p\n",&a[1]);
printf("address of a[1] is%p\n",ptr);
return 0;
}

You might also like