{"id":341,"date":"2023-01-19T13:47:29","date_gmt":"2023-01-19T13:47:29","guid":{"rendered":"https:\/\/aipsacademy.com\/blogs\/?p=341"},"modified":"2023-07-28T03:56:44","modified_gmt":"2023-07-28T03:56:44","slug":"arrays-in-c-programming-language","status":"publish","type":"post","link":"https:\/\/aipsacademy.com\/blogs\/2023\/01\/19\/arrays-in-c-programming-language\/","title":{"rendered":"Arrays in C++ Programming Language"},"content":{"rendered":"\n
\n

Arrays are the fixed size, sequence collection of elements of same type.<\/strong><\/p>\n\n\n\n

It used to handle large volume of data in the term storing, Accessing and manipulating.<\/p>\n\n\n\n

It is a derived data type<\/a>, because we have to take help of primary data type <\/a>when we use an array.without primary data type array can’t be used.<\/p>\n\n\n\n

It shares common name for all its elements.<\/p>\n\n\n\n

It works on index number and index begins with zero and ends with size -1.<\/p>\n\n\n\n

Size of an array is known as subscript<\/a> of an array.<\/p>\n\n\n\n

It can be considered as set of elements stored in consecutive memory location but having same data type.<\/p>\n<\/div><\/div>\n\n\n\n

Types of Arrays<\/h2>\n\n\n\n

There are two types of array.<\/p>\n\n\n\n

  1. single dimensional Array<\/li>
  2. Double or Multi dimensional Array<\/li><\/ol>\n\n\n\n

    Single dimensional Array:<\/strong>– <\/h4>\n\n\n\n
    \n

    An Array which works on single index , is known as single dimensional array or 1- D Array.<\/p>\n\n\n\n

    It is used for searching , sorting etc.<\/p>\n\n\n\n

    Syntax :<\/p>\n\n\n\n

    Datatype Array_Name[size];<\/strong><\/p>\n\n\n\n

    int ar[5];<\/p>\n\n\n\n

    Q.Find sum of five numbers without array.<\/p><\/blockquote>\n\n\n\n

    #include<iostream.h>\n#include<conio.h>\nvoid main()\n{\nclrscr();\nint a,b,c,d,e,f;\na=5;\nb=7;\nc=9;\nd=11;\ne=13;\nf=a+b+c+d+e;\ncout<<\"Sum=\"<<f;\ngetch();\n}<\/code><\/pre>\n\n\n\n
    output<\/strong><\/p>\n\n\n\n
    sum=45<\/p>\n\n\n\n
    Q.Find sum of Five numbers using array.(only for cocept)<\/p><\/blockquote>\n\n\n\n
    #include<iostream.h>\n#include<conio.h>\nvoid main()\n{\nclrscr();\nint a[5],s;\na[0]=5;\na[1]=7;\na[2]=9;\na[3]=11;\na[4]=13;\ns=a[0]+a[1]+a[2]+a[3]+a[4];\ncout<<\u201dSum=\u201d<<s;\ngetch();\n}\n<\/code><\/pre>\n\n\n\n
    Output<\/strong><\/p>\n\n\n\n
    sum=45<\/p>\n\n\n\n
    OR<\/p><\/blockquote>\n\n\n\n
    #include<iostream.h>\n#include<conio.h>\nvoid main()\n{\nclrscr();\nint a[5]={5,7,9,11,13},s;\ns=a[0]+a[1]+a[2]+a[3]+a[4];\ncout<<\u201dSum=\u201d<<s;\ngetch();\n}<\/code><\/pre>\n\n\n\n
    Output<\/strong><\/p>\n\n\n\n
    Sum=45<\/p>\n\n\n\n
    OR<\/p><\/blockquote>\n\n\n\n
    #include<iostream.h>\n#include<conio.h>\nvoid main()\n{\nclrscr();\nint a[5],s;\ncout<<\u201dEnter five numbers=\u201d\ncin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4];\ns=a[0]+a[1]+a[2]+a[3]+a[4];\ncout<<\u201dSum=\u201d<<s;\ngetch();\n}\n<\/code><\/pre>\n\n\n\n
    output<\/strong><\/p>\n\n\n\n
    \n
    Enter five numbers=5<\/p>\n\n\n\n
    7<\/p>\n\n\n\n
    9<\/p>\n\n\n\n
    11<\/p>\n\n\n\n
    13<\/p>\n\n\n\n
    Sum=45<\/p>\n<\/div><\/div>\n\n\n\n
    <\/p>\n<\/div><\/div>\n\n\n\n
    Q.Write a program to represent single dimensional array.<\/p><\/blockquote>\n\n\n\n
    #include<iostream.h>\n#include<conio.h>\nvoid main()  \n{\nclrscr();\nint a[5],i;\t\ncout<<\u201dEnter five elements\u201d;\nfor(i=0;i<5;i++)\n{\ncin>>a[i];\n}\ncout<<\u201dEntered elements are\u201d;\nfor(i=0;i<5;i++)\n{\ncout<<\u201d\\n\u201d<<a[i];\n}\n\ngetch();\n}\n<\/code><\/pre>\n\n\n\n
    Output<\/p>\n\n\n\n
    \n
    Enter five elements=11<\/p>\n\n\n\n
    12<\/p>\n\n\n\n
    13<\/p>\n\n\n\n
    14<\/p>\n\n\n\n
    15<\/p>\n\n\n\n
    Entered elements are<\/p>\n\n\n\n
    11<\/p>\n\n\n\n
    12<\/p>\n\n\n\n
    13<\/p>\n\n\n\n
    14<\/p>\n\n\n\n
    15<\/p>\n<\/div><\/div>\n\n\n\n
    Q.Write a program to print Array’s elements in reverse order.<\/p><\/blockquote>\n\n\n\n
    #include<iostream.h>\n#include<conio.h>\nvoid main()  \n{\nclrscr();\nint a[5],i;\t\ncout<<\u201dEnter five element\u201d;\nfor(i=0;i<5;i++)\n{\ncin>>a[i];\n}\ncout<<\u201dEntered elements in reverse order\u201d;\nfor(i=4;i>=0;i--)\n{\ncout<<\u201d\\n\u201d<<a[i];\n}\n\ngetch();\n}\n<\/code><\/pre>\n\n\n\n
    Output<\/p>\n\n\n\n
    \n
    Enter five elements<\/p>\n\n\n\n
    11<\/p>\n\n\n\n
    12<\/p>\n\n\n\n
    13<\/p>\n\n\n\n
    14<\/p>\n\n\n\n
    15<\/p>\n\n\n\n
    Entered elements in reverse order<\/p>\n\n\n\n
    15<\/p>\n\n\n\n
    14<\/p>\n\n\n\n
    13<\/p>\n\n\n\n
    12<\/p>\n\n\n\n
    11<\/p>\n<\/div><\/div>\n\n\n\n
    Q.Write a program to enter number of elements in an array and print them<\/p><\/blockquote>\n\n\n\n
    #include<iostream.h>\n#include<conio.h>\nvoid main()  \n{\nclrscr();\nint a[50],n,i;\t\ncout<<\u201dEnter number of elements=\u201d;\ncin>>n;\ncout<<\u201dEnter arrays elements=\u201d;\nfor(i=0;i<n;i++)\n{\ncin>>a[i];\n}\ncout<<\u201dEntered elements are\u201d;\nfor(i=0;i<n;i++)\n{\ncout<<\u201d\\n\u201d<<a[i];\n}\n\ngetch();\n}\n<\/code><\/pre>\n\n\n\n
    output<\/p>\n\n\n\n
    \n
    Enter number of elements=5<\/p>\n\n\n\n
    Enter arrays elements=11<\/p>\n\n\n\n
    12<\/p>\n\n\n\n
    13<\/p>\n\n\n\n
    14<\/p>\n\n\n\n
    15<\/p>\n\n\n\n
    Entered elements are<\/p>\n\n\n\n
    11<\/p>\n\n\n\n
    12<\/p>\n\n\n\n
    13<\/p>\n\n\n\n
    14<\/p>\n\n\n\n
    15<\/p>\n<\/div><\/div>\n\n\n\n
    Q.Write a program to enter number of elements in array and print them in reverse order.<\/p><\/blockquote>\n\n\n\n
    #include<iostream.h>\n#include<conio.h>\nvoid main()  \n{\nclrscr();\nint a[50],n,i;\t\ncout<<\u201dEnter number of elements=\u201d;\ncin>>n;\ncout<<\u201dEnter arrays elements=\u201d;\nfor(i=0;i<n;i++)\n{\ncin>>a[i];\n}\ncout<<\u201dEntered elements in reverse\u201d;\nfor(i=n-1;i>=0;i--)\n{\ncout<<\u201d\\n\u201d<<a[i];\n}\n\ngetch();\n}\n<\/code><\/pre>\n\n\n\n
    output<\/p>\n\n\n\n
    \n
    Enter number of elements=5<\/p>\n\n\n\n
    Enter arrays elements=11<\/p>\n\n\n\n
    12<\/p>\n\n\n\n
    13<\/p>\n\n\n\n
    14<\/p>\n\n\n\n
    15<\/p>\n\n\n\n
    Entered elements in reverse<\/p>\n\n\n\n
    15<\/p>\n\n\n\n
    14<\/p>\n\n\n\n
    13<\/p>\n\n\n\n
    12<\/p>\n\n\n\n
    11<\/p>\n<\/div><\/div>\n\n\n\n
    Q.Write a program to find sum of entered arrays elements.<\/p><\/blockquote>\n\n\n\n
    #include<iostream.h>\n#include<conio.h>\nvoid main()  \n{\nclrscr();\nint a[50],n,i,s=0;\t\ncout<<\u201dEnter number of elements=\u201d;\ncin>>n;\ncout<<\u201dEnter arrays elements=\u201d;\nfor(i=0;i<n;i++)\n{\ncin>>a[i];\n}\ncout<<\u201dEntered elements are\u201d;\nfor(i=0;i<n;i++)\n{\ncout<<\u201d\\n\u201d<<a[i];\ns=s+a[i];\n}\ncout<<\u201d\\nSum of elements =\u201d<<s;\ngetch();\n}\n<\/code><\/pre>\n\n\n\n
    output<\/strong><\/p>\n\n\n\n
    \n
    Enter number of elements=5<\/p>\n\n\n\n
    Enter arrays elements=11<\/p>\n\n\n\n
    12<\/p>\n\n\n\n
    13<\/p>\n\n\n\n
    14<\/p>\n\n\n\n
    15<\/p>\n\n\n\n
    Entered elements are<\/p>\n\n\n\n
    11<\/p>\n\n\n\n
    12<\/p>\n\n\n\n
    13<\/p>\n\n\n\n
    14<\/p>\n\n\n\n
    15<\/p>\n\n\n\n
    sum of elements =65<\/p>\n\n\n\n
    Q.Write a program to find the smallest element in an array.<\/p><\/blockquote>\n<\/div><\/div>\n\n\n\n
    #include<iostream.h>\n#include<conio.h>\nvoid main()  \n{\nclrscr();\nint a[50],n,i,s;\t\ncout<<\"Enter number of elements=\";\ncin>>n;\ncout<<\"Enter arrays elements=\";\nfor(i=0;i<n;i++)\ncin>>a[i];\n\ns=a[0];\nfor(i=1;i<n;i++)\n{\nif(s>a[i])\ns=a[i];\n}\ncout<<\"Smallest element =\"<<s;\ngetch();\n}\n<\/code><\/pre>\n\n\n\n
    Output<\/strong><\/p>\n\n\n\n
    \n
    Enter number of elements=5<\/p>\n\n\n\n
    Enter array’s elements=12<\/p>\n\n\n\n
    15<\/p>\n\n\n\n
    11<\/p>\n\n\n\n
    25<\/p>\n\n\n\n
    13<\/p>\n\n\n\n
    Smallest element=11<\/p>\n<\/div><\/div>\n\n\n\n
    Q.Write  program to find largest element in an array.<\/p><\/blockquote>\n\n\n\n
    #include<iostream.h>\n#include<conio.h>\nvoid main()  \n{\nclrscr();\nint a[50],n,i,l;\t\ncout<<\u201dEnter number of elements=\u201d;\ncin>>n;\ncout<<\u201dEnter arrays elements=\u201d;\nfor(i=0;i<n;i++)\ncin>>a[i];\n\nl=a[0];\nfor(i=1;i<n;i++)\n{\nif(l<a[i])\nl=a[i];\n}\ncout<<\u201dLargest element =\u201d<<l;\ngetch();\n}\n<\/code><\/pre>\n\n\n\n
    Output<\/strong><\/p>\n\n\n\n
    \n
    \n
    Enter number of elements=5<\/p>\n\n\n\n
    Enter array’s elements=12<\/p>\n\n\n\n
    15<\/p>\n\n\n\n
    11<\/p>\n\n\n\n
    25<\/p>\n\n\n\n
    13<\/p>\n\n\n\n
    Largest element=25<\/p>\n<\/div><\/div>\n<\/div><\/div>\n\n\n\n
    Q.Write a program to find largest and smallest element in an array. <\/p><\/blockquote>\n\n\n\n
    #include<iostream.h>\n#include<conio.h>\nvoid main()  \n{\nclrscr();\nint a[50],n,i,l,s;\t\ncout<<\u201dEnter number of elements=\u201d;\ncin>>n;\ncout<<\u201dEnter arrays elements=\u201d;\nfor(i=0;i<n;i++)\ncin>>a[i];\n\ns=a[0];\nl=a[0];\nfor(i=1;i<n;i++)\n{\nif(s>a[i])\ns=a[i];\n\nif(l<a[i])\nl=a[i];\n}\ncout<<\u201dSmallest element=\u201d<<s;\ncout<<\u201dLargest element =\u201d<<l;\ngetch();\n}\n<\/code><\/pre>\n\n\n\n
    Output<\/strong><\/p>\n\n\n\n
    \n
    \n
    Enter number of elements=5<\/p>\n\n\n\n
    Enter array’s elements=12<\/p>\n\n\n\n
    15<\/p>\n\n\n\n
    11<\/p>\n\n\n\n
    25<\/p>\n\n\n\n
    13<\/p>\n\n\n\n
    Smallest element=11<\/p>\n\n\n\n
    Largest element=25<\/p>\n<\/div><\/div>\n<\/div><\/div>\n\n\n\n
    Q.Write a program to represent Searching.  OR Write a program to check particular is present or not in Array.<\/p><\/blockquote>\n\n\n\n
    #include<iostream.h>\n#include<conio.h>\nvoid main()  \n{\nclrscr();\nint a[50],n,i,t,j=0;\t\ncout<<\u201dEnter number of elements=\u201d;\ncin>>n;\ncout<<\u201dEnter arrays elements=\u201d;\nfor(i=0;i<n;i++)\ncin>>a[i];\ncout<<\u201dEnter element which to be searched=\u201d;\ncin>>t;\nfor(i=0;i<n;i++)\n{\nif(t==a[i])\n{\nj=1;\nbreak;\n}\n}\nif(j==1)\ncout<<\u201dElement found at=\u201d<<(i+1);\nelse\ncout<<\u201dElement not found\u201d;\ngetch();\n}\n<\/code><\/pre>\n\n\n\n
    Output<\/strong><\/p>\n\n\n\n
    \n
    \n
    \n
    Enter number of elements=5<\/p>\n\n\n\n
    Enter array’s elements=12<\/p>\n\n\n\n
    15<\/p>\n\n\n\n
    11<\/p>\n\n\n\n
    25<\/p>\n\n\n\n
    13<\/p>\n\n\n\n
    Enter element which to be searched=11<\/p>\n\n\n\n
     Element found at=3<\/p>\n<\/div><\/div>\n<\/div><\/div>\n<\/div><\/div>\n\n\n\n
    <\/p>\n\n\n\n
    <\/p>\n\n\n\n
    Double Dimensional Array:-<\/h4>\n\n\n\n
    \n
    An array which works on double index is called double dimensional array or 2 -D Array.<\/p>\n\n\n\n
    It is used for matrix manipulation or handle data in tabular form.<\/p>\n<\/div><\/div>\n\n\n\n
    Syntax :<\/p>\n\n\n\n
    Datatype Array_Name[size][size];<\/strong><\/p>\n\n\n\n
    int ar[5][5];<\/p>\n\n\n\n
    Q.Write a program to represent double dimensional array<\/p><\/blockquote>\n\n\n\n
    <\/p>\n\n\n\n
    <\/p>\n\n\n\n
    to be continued…. Plz check for daily update….<\/p>\n","protected":false},"excerpt":{"rendered":"
    Arrays are the fixed size, sequence collection of elements of same type. It used to handle large volume of data in the term storing, Accessing and manipulating. It is a derived data type, because we have to take help of primary data type when we use an array.without primary data type array can’t be used. […]<\/p>\n","protected":false},"author":1,"featured_media":342,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[4,5,7,6,8],"tags":[],"class_list":["post-341","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-11th-computer-science","category-12th-computer-science","category-cbse","category-jac","category-jac-12th-computer-science"],"_links":{"self":[{"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/posts\/341","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/comments?post=341"}],"version-history":[{"count":7,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/posts\/341\/revisions"}],"predecessor-version":[{"id":601,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/posts\/341\/revisions\/601"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/media\/342"}],"wp:attachment":[{"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/media?parent=341"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/categories?post=341"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/aipsacademy.com\/blogs\/wp-json\/wp\/v2\/tags?post=341"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}