{"id":1573,"date":"2024-05-11T06:22:35","date_gmt":"2024-05-11T05:22:35","guid":{"rendered":"https:\/\/ramamm.com\/?p=1573"},"modified":"2024-05-11T06:22:36","modified_gmt":"2024-05-11T05:22:36","slug":"arrays","status":"publish","type":"post","link":"https:\/\/ramamm.com\/?p=1573","title":{"rendered":"ARRAYS"},"content":{"rendered":"
\n
\n
\n

Copy ele of array<\/p>

<\/span>\n <\/div><\/div>
\n\n

<\/p>\n\n\n\n

\n
#include <stdio.h><\/div>\n
int main()<\/div>\n
{<\/div>\n
\u00a0 \u00a0 int i,n,arr1[20],arr2[20];<\/div>\n
\u00a0 \u00a0 printf(“enter the elements of array”);<\/div>\n
\u00a0 \u00a0 scanf(“%d”,&n);<\/div>\n
\u00a0 \u00a0 for(i=0;i<n;i++)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 printf(“%d\\t”,i);<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 scanf(“%d”,&arr1[i]);<\/div>\n
\u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 for(i=0;i<n;i++)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 arr2[i]=arr1[i];<\/div>\n
\u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 printf(“the copied elements are\\n”);<\/div>\n
\u00a0 \u00a0 \u00a0for(i=0;i<n;i++)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 printf(“%d\\t”,arr2[i]);<\/div>\n
\u00a0 \u00a0 }<\/div>\n
}<\/div>\n<\/div>\n\n<\/div><\/div>\n<\/div>\n\n
\n
\n
\n

Count dupli in array<\/p>

<\/span>\n <\/div><\/div>
\n\n

<\/p>\n\n\n\n

\n
#include <stdio.h><\/div>\n
int main()<\/div>\n
{<\/div>\n
\u00a0 \u00a0 int i,j,ctr=0,n,arr[30];<\/div>\n
\u00a0 \u00a0 printf(“enter enter the number elements to be stored in an array”);<\/div>\n
\u00a0 \u00a0 scanf(“%d”,&n);<\/div>\n
\u00a0 \u00a0 for(i=0;i<n;i++)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0printf(“element-%d\\t”,i);<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0scanf(“%d”,&arr[i]);<\/div>\n
\u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 for(i=0;i<n;i++)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 for(j=i+1;j<n;j++)<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 if(arr[i]==arr[j])<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 ctr++;<\/div>\n

\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 }<\/div>\n

\n
\u00a0 \u00a0 \u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 printf(“duplicates fount are %d”,ctr);<\/div>\n
}<\/div>\n<\/div>\n\n<\/div><\/div>\n<\/div>\n\n
\n
\n
\n

Count frequency of a number<\/p>

<\/span>\n <\/div><\/div>
\n\n

<\/p>\n\n\n\n

\n
#include <stdio.h><\/div>\n
int main()<\/div>\n
{<\/div>\n
\u00a0 \u00a0 int n,i,j,arr1[30],fr[30],ctr;<\/div>\n
\u00a0 \u00a0 printf(“enter the size of array”);<\/div>\n
\u00a0 \u00a0 scanf(“%d”,&n);<\/div>\n
\u00a0 \u00a0 for(i=0;i<n;i++)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 printf(“%d”,i);<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 scanf(“%d”,&arr1[i]);<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 fr[i]=-1;<\/div>\n
\u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 for(i=0;i<n;i++)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 ctr=1;<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 for(j=i+1;j<n;j++)<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 if(arr1[i]=arr1[j])<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 ctr++;<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 fr[j]=0;<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 if(fr[i]!=0)<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 fr[i]=ctr;<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 }<\/div>\n
\n
\u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 for(i=0;i<n;i++)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\n
\u00a0 \u00a0 if(fr[i]!=0)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 printf(“%d is repeted %d times”,arr1[i],fr[i]);<\/div>\n
\u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 }<\/div>\n
}<\/div>\n<\/div>\n\n<\/div><\/div>\n<\/div>\n\n
\n
\n
\n

Max Min of array<\/p>

<\/span>\n <\/div><\/div>
\n\n

<\/p>\n\n\n\n

\n
#include <stdio.h><\/div>\n
int main()<\/div>\n
{<\/div>\n
\u00a0 \u00a0 int n,arr[30],i,max,min;<\/div>\n
\u00a0 \u00a0 printf(“enter the size of array”);<\/div>\n
\u00a0 \u00a0 scanf(“%d”,&n);<\/div>\n
\u00a0 \u00a0 for(i=0;i<n;i++)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 printf(“%d”,i);<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 scanf(“%d”,&arr[i]);<\/div>\n
\u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 max=arr[0];<\/div>\n
\u00a0 \u00a0 min=arr[0];<\/div>\n
\u00a0 \u00a0 for(i=0;i<n;i++)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 if(arr[i]>max)<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 max=arr[i];<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 if(arr[i]<min)<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 min=arr[i];<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 printf(“%d-maximum\\n%d-minimum”,max,min);<\/div>\n
}<\/div>\n<\/div>\n\n<\/div><\/div>\n<\/div>\n\n
\n
\n
\n

Merge 2 arrays in desc<\/p>

<\/span>\n <\/div><\/div>
\n\n

<\/p>\n\n\n\n

\n
#include <stdio.h><\/div>\n
int main()<\/div>\n
{<\/div>\n
\u00a0 \u00a0 int s1,s2,s3,arr1[30],arr2[30],arr3[30],i,j,k;<\/div>\n
\u00a0 \u00a0 printf(“enter the size of first array”);<\/div>\n
\u00a0 \u00a0 scanf(“%d”,&s1);<\/div>\n
\u00a0 \u00a0 printf(“the elements of first array”);<\/div>\n
\u00a0 \u00a0 for(i=0;i<s1;i++)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 printf(“%d”,i);<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 scanf(“%d”,&arr1[i]);<\/div>\n
\u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 printf(“enter the size of second array”);<\/div>\n
\u00a0 \u00a0 scanf(“%d”,&s2);<\/div>\n
\u00a0 \u00a0 printf(“the elements of second array”);<\/div>\n
\u00a0 \u00a0 for(i=0;i<s2;i++)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 printf(“%d”,i);<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 scanf(“%d”,&arr2[i]);<\/div>\n
\u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 s3=s1+s2;<\/div>\n
\u00a0 \u00a0 for(i=0;i<s1;i++)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 arr3[i]=arr1[i];<\/div>\n
\u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 for(j=0;j<s2;j++)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 arr3[i]=arr2[j];<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 i++;<\/div>\n
\u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 for(i=0;i<s3;i++)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 for(k=0;k<s3-1;k++)<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 if(arr3[k]<=arr3[k+1])<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 j=arr3[k];<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 arr3[k+1]=arr3[k];<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 arr3[k]=j;<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 for(i=0;i<s3;i++)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 printf(“%d”,arr3[i]);<\/div>\n
\u00a0 \u00a0 }<\/div>\n
}<\/div>\n<\/div>\n\n<\/div><\/div>\n<\/div>\n\n
\n
\n
\n

Reverse array<\/p>

<\/span>\n <\/div><\/div>
\n\n

<\/p>\n\n\n\n

\n
#include <stdio.h><\/div>\n
int main()<\/div>\n
{<\/div>\n
\u00a0 \u00a0 int i,arr[30],n;<\/div>\n
\u00a0 \u00a0 printf(“enter the size of array\\n”);<\/div>\n
\u00a0 \u00a0 scanf(“%d”,&n);<\/div>\n
\u00a0 \u00a0 for(i=0;i<n;i++)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 printf(“%d\\t”,i);<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 scanf(“%d”,&arr[i]);<\/div>\n
\u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 printf(“the reverse elemnts are\\n”);<\/div>\n
\u00a0 \u00a0 for(i=n-1;i>=0;i–)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 printf(“%d\\t”,arr[i]);<\/div>\n
\u00a0 \u00a0 }<\/div>\n
}<\/div>\n<\/div>\n\n<\/div><\/div>\n<\/div>\n\n
\n
\n
\n

seperate even and odd<\/p>

<\/span>\n <\/div><\/div>
\n\n

#include <stdio.h><\/p>\n\n\n\n

int main()<\/p>\n\n\n\n

{<\/p>\n\n\n\n

    int arr1[30],arr2[30],arr3[30],i,j=0,k=0,n;<\/p>\n\n\n\n

    printf(“enter the size of array”);<\/p>\n\n\n\n

    scanf(“%d”,&n);<\/p>\n\n\n\n

    for(i=0;i<n;i++)<\/p>\n\n\n\n

    {<\/p>\n\n\n\n

        printf(“%d”,i);<\/p>\n\n\n\n

        scanf(“%d”,&arr1[i]);<\/p>\n\n\n\n

    }<\/p>\n\n\n\n

    for(i=0;i<n;i++)<\/p>\n\n\n\n

    {<\/p>\n\n\n\n

        if(arr1[i]%2==0)<\/p>\n\n\n\n

        {<\/p>\n\n\n\n

            arr2[j]=arr1[i];<\/p>\n\n\n\n

            j++;<\/p>\n\n\n\n

        }<\/p>\n\n\n\n

        else<\/p>\n\n\n\n

        {<\/p>\n\n\n\n

            arr3[k]=arr1[i];<\/p>\n\n\n\n

            k++;<\/p>\n\n\n\n

        }<\/p>\n\n\n\n

    }<\/p>\n\n\n\n

    printf(“the even elements are”);<\/p>\n\n\n\n

    for(i=0;i<j;i++)<\/p>\n\n\n\n

    {<\/p>\n\n\n\n

        printf(“%d”,arr2[i]);<\/p>\n\n\n\n

    }<\/p>\n\n\n\n

    printf(“the odd elements are”);<\/p>\n\n\n\n

    for(i=0;i<k;i++)<\/p>\n\n\n\n

    {<\/p>\n\n\n\n

        printf(“%d”,arr3[i]);<\/p>\n\n\n\n

    }<\/p>\n\n\n\n

}<\/p>\n\n<\/div><\/div>\n<\/div>\n\n

\n
\n
\n

Sort array in ascending<\/p>

<\/span>\n <\/div><\/div>
\n\n

<\/p>\n\n\n\n

\n
#include <stdio.h><\/div>\n
int main()<\/div>\n
{<\/div>\n
\u00a0 \u00a0 int i,j,n,arr[30],temp;<\/div>\n
\u00a0 \u00a0 printf(“enter the size of array”);<\/div>\n
\u00a0 \u00a0 scanf(“%d”,&n);<\/div>\n
\u00a0 \u00a0 for(i=0;i<n;i++)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 printf(“%d”,i);<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 scanf(“%d”,&arr[i]);<\/div>\n
\u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 for(i=0;i<n;i++)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 for(j=i+1;j<n;j++)<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 if(arr[i]<arr[j])<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 temp=arr[i];<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 arr[i]=arr[j];<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 arr[j]=temp;<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 printf(“the soreted array is”);<\/div>\n
\u00a0 \u00a0 for(i=0;i<n;i++)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 printf(“%d”,arr[i]);<\/div>\n
\u00a0 \u00a0 }<\/div>\n
}<\/div>\n<\/div>\n\n<\/div><\/div>\n<\/div>\n\n
\n
\n
\n

Sort array in descending<\/p>

<\/span>\n <\/div><\/div>
\n\n

<\/p>\n\n\n\n

\n
#include <stdio.h><\/div>\n
int main()<\/div>\n
{<\/div>\n
\u00a0 \u00a0 int i,j,n,arr[30],temp;<\/div>\n
\u00a0 \u00a0 printf(“enter the size of array”);<\/div>\n
\u00a0 \u00a0 scanf(“%d”,&n);<\/div>\n
\u00a0 \u00a0 for(i=0;i<n;i++)<\/div>\n
\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 printf(“%d”,i);<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 scanf(“%d”,&arr[i]);<\/div>\n
\u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 for(i=0;i<n;i++)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 for(j=i+1;j<n;j++)<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 if(arr[i]<arr[j])<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 temp=arr[i];<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 arr[i]=arr[j];<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 arr[j]=temp;<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 printf(“the soreted array is”);<\/div>\n
\u00a0 \u00a0 for(i=0;i<n;i++)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 printf(“%d\\t”,arr[i]);<\/div>\n
\u00a0 \u00a0 }<\/div>\n
}<\/div>\n<\/div>\n\n<\/div><\/div>\n<\/div>\n\n
\n
\n
\n

Sum of ele in array<\/p>

<\/span>\n <\/div><\/div>
\n\n

<\/p>\n\n\n\n

\n
#include <stdio.h><\/div>\n
int main()<\/div>\n
{<\/div>\n
\u00a0 \u00a0 int i,j,n,arr[30],temp;<\/div>\n
\u00a0 \u00a0 printf(“enter the size of array”);<\/div>\n
\u00a0 \u00a0 scanf(“%d”,&n);<\/div>\n
\u00a0 \u00a0 for(i=0;i<n;i++)<\/div>\n
\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 printf(“%d”,i);<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 scanf(“%d”,&arr[i]);<\/div>\n
\u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 for(i=0;i<n;i++)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 for(j=i+1;j<n;j++)<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 if(arr[i]<arr[j])<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 temp=arr[i];<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 arr[i]=arr[j];<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 arr[j]=temp;<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 }<\/div>\n
\u00a0 \u00a0 printf(“the soreted array is”);<\/div>\n
\u00a0 \u00a0 for(i=0;i<n;i++)<\/div>\n
\u00a0 \u00a0 {<\/div>\n
\u00a0 \u00a0 \u00a0 \u00a0 printf(“%d\\t”,arr[i]);<\/div>\n
\u00a0 \u00a0 }<\/div>\n
}<\/div>\n<\/div>\n\n<\/div><\/div>\n<\/div>\n\n
\n
\n
\n

Unique ele in array<\/p>

<\/span>\n <\/div><\/div>
\n\n

<\/p>\n\n\n\n

#include <stdio.h><\/p>\n\n\n\n

int main()<\/p>\n\n\n\n

{<\/p>\n\n\n\n

    int i,j,k,n,arr[30],ctr=0;<\/p>\n\n\n\n

    printf(“enter the size of a array”);<\/p>\n\n\n\n

    scanf(“%d”,&n);<\/p>\n\n\n\n

    for(i=0;i<n;i++)<\/p>\n\n\n\n

    {<\/p>\n\n\n\n

        printf(“%d”,i);<\/p>\n\n\n\n

        scanf(“%d”,&arr[i]);<\/p>\n\n\n\n

    }<\/p>\n\n\n\n

    printf(“the unique elements are”);<\/p>\n\n\n\n

    for(i=0;i<n;i++)<\/p>\n\n\n\n

    {<\/p>\n\n\n\n

        ctr=0;<\/p>\n\n\n\n

        for(j=0,k=n;j<k+1;j++)<\/p>\n\n\n\n

        {<\/p>\n\n\n\n

            if(i!=j)<\/p>\n\n\n\n

            {<\/p>\n\n\n\n

            if((arr[i]==arr[j])&&(arr[j]==arr[i]))<\/p>\n\n\n\n

            {<\/p>\n\n\n\n

                ctr++;<\/p>\n\n\n\n

            }<\/p>\n\n\n\n

            }<\/p>\n\n\n\n

        }<\/p>\n\n\n\n

    if(ctr==0)<\/p>\n\n\n\n

    {<\/p>\n\n\n\n

        printf(“%d”,arr[i]);<\/p>\n\n\n\n

    }<\/p>\n\n\n\n

    }<\/p>\n\n\n\n

}<\/p>\n\n<\/div><\/div>\n<\/div>","protected":false},"excerpt":{"rendered":"","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"ub_ctt_via":"","_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"site-sidebar-layout":"default","site-content-layout":"","ast-site-content-layout":"default","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"set","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""}},"footnotes":""},"categories":[1],"tags":[],"featured_image_src":null,"author_info":{"display_name":"ramamm.com","author_link":"https:\/\/ramamm.com\/?author=1"},"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/ramamm.com\/index.php?rest_route=\/wp\/v2\/posts\/1573"}],"collection":[{"href":"https:\/\/ramamm.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/ramamm.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/ramamm.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/ramamm.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1573"}],"version-history":[{"count":1,"href":"https:\/\/ramamm.com\/index.php?rest_route=\/wp\/v2\/posts\/1573\/revisions"}],"predecessor-version":[{"id":1574,"href":"https:\/\/ramamm.com\/index.php?rest_route=\/wp\/v2\/posts\/1573\/revisions\/1574"}],"wp:attachment":[{"href":"https:\/\/ramamm.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1573"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/ramamm.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1573"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/ramamm.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1573"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}