{"id":38112,"date":"2025-06-30T11:56:11","date_gmt":"2025-06-30T06:26:11","guid":{"rendered":"https:\/\/www.iquanta.in\/blog\/?p=38112"},"modified":"2025-06-30T11:56:14","modified_gmt":"2025-06-30T06:26:14","slug":"array-in-data-structure-types-and-complexity-analysis","status":"publish","type":"post","link":"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/","title":{"rendered":"Array in Data Structure : Types and Complexity Analysis"},"content":{"rendered":"\n<p>In the era of computer science, managing and handling data is important to build powerful and adaptable applications. There are various data structures available to manage and organize data.&nbsp;<\/p>\n\n\n\n<p>An array in data structure is a collection of elements that are of the same data type, where each element is uniquely accessed using its corresponding index . It is a basic building block to understand complex data structures.<\/p>\n\n\n\n<p>Whether you are a beginner or experienced developer (working professional) understanding complexity analysis and optimizing solutions is key.&nbsp;<\/p>\n\n\n\n<p>In this article we will focus on understanding array in data structure , exploring their types, representation of arrays in memory, several operations performed on arrays, complexity analysis, advantages &amp; disadvantages of arrays.<\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-large\"><a href=\"https:\/\/chat.whatsapp.com\/GZYuRkYZpuC4BJfrrHvv9J\"><img fetchpriority=\"high\" decoding=\"async\" width=\"1024\" height=\"159\" src=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/01\/DSAWHATSAPPBANNER-2-17-1024x159.jpg\" alt=\"\" class=\"wp-image-41468\" srcset=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/01\/DSAWHATSAPPBANNER-2-17-1024x159.jpg 1024w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/01\/DSAWHATSAPPBANNER-2-17-300x47.jpg 300w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/01\/DSAWHATSAPPBANNER-2-17-768x119.jpg 768w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/01\/DSAWHATSAPPBANNER-2-17-1536x238.jpg 1536w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/01\/DSAWHATSAPPBANNER-2-17-2048x317.jpg 2048w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/01\/DSAWHATSAPPBANNER-2-17-150x23.jpg 150w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/01\/DSAWHATSAPPBANNER-2-17-696x108.jpg 696w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/01\/DSAWHATSAPPBANNER-2-17-1068x166.jpg 1068w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/01\/DSAWHATSAPPBANNER-2-17-1920x298.jpg 1920w\" sizes=\"(max-width: 1024px) 100vw, 1024px\" \/><\/a><\/figure><\/div>\n\n\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_77 counter-hierarchy ez-toc-counter ez-toc-grey ez-toc-container-direction\">\n<div class=\"ez-toc-title-container\">\n<p class=\"ez-toc-title\" style=\"cursor:inherit\">Table of Contents<\/p>\n<span class=\"ez-toc-title-toggle\"><a href=\"#\" class=\"ez-toc-pull-right ez-toc-btn ez-toc-btn-xs ez-toc-btn-default ez-toc-toggle\" aria-label=\"Toggle Table of Content\"><span class=\"ez-toc-js-icon-con\"><span class=\"\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #999;color:#999\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #999;color:#999\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/span><\/a><\/span><\/div>\n<nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><li class='ez-toc-page-1 ez-toc-heading-level-1'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#What_is_Array_in_Data_Structure\" >What is Array in Data Structure ?<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-1'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#Types_of_Arrays_in_Data_Structure\" >Types of Arrays in Data Structure&nbsp;<\/a><ul class='ez-toc-list-level-2' ><li class='ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#Linear_Dimensional_Array_in_Data_Structure_1D\" >Linear Dimensional&nbsp;Array in Data Structure (1D)<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#Two-Dimensional_Array_in_Data_Structure_2D\" >Two-Dimensional Array in Data Structure (2D)<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-5\" href=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#Multiple_Dimensional_Array_in_Data_Structure\" >Multiple Dimensional Array in Data Structure<\/a><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-1'><a class=\"ez-toc-link ez-toc-heading-6\" href=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#Memory_Allocation_of_Arrays\" >Memory Allocation of Arrays&nbsp;<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-1'><a class=\"ez-toc-link ez-toc-heading-7\" href=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#Operations_on_an_Array_in_Data_Structure\" >Operations on an Array in Data Structure&nbsp;<\/a><ul class='ez-toc-list-level-2' ><li class='ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-8\" href=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#Search_Operation_Searching\" >Search Operation (Searching)<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-9\" href=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#Insertion_Operation\" >Insertion Operation<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-10\" href=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#Deletion_Operation\" >Deletion Operation<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-11\" href=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#Traversing\" >Traversing<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-12\" href=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#Sorting_Operation\" >Sorting Operation<\/a><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-1'><a class=\"ez-toc-link ez-toc-heading-13\" href=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#Complexity_Analysis_in_Array_Data_Structure\" >Complexity Analysis in Array Data Structure<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-1'><a class=\"ez-toc-link ez-toc-heading-14\" href=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#Advantages_of_Array_Data_Structure\" >Advantages of Array Data Structure<\/a><ul class='ez-toc-list-level-2' ><li class='ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-15\" href=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#Easy_Implementation\" >Easy Implementation&nbsp;<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-16\" href=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#Static_Size_Fixed_Size_of_an_Array\" >Static Size ( Fixed Size of an Array)<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-17\" href=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#Flexibility_of_Supporting_Data_Types\" >Flexibility of Supporting Data Types<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-18\" href=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#Faster_Data_Access\" >Faster Data Access<\/a><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-1'><a class=\"ez-toc-link ez-toc-heading-19\" href=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#Disadvantages_of_Array_Data_Structures\" >Disadvantages of Array Data Structures<\/a><ul class='ez-toc-list-level-2' ><li class='ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-20\" href=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#Insertion_Deletion_Cost\" >Insertion &amp; Deletion Cost<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-21\" href=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#Built-in_Methods\" >Built-in Methods<\/a><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-1'><a class=\"ez-toc-link ez-toc-heading-22\" href=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#Conclusion\" >Conclusion<\/a><\/li><\/ul><\/nav><\/div>\n<h1 class=\"wp-block-heading\" id=\"h-what-is-array-in-data-structure\"><span class=\"ez-toc-section\" id=\"What_is_Array_in_Data_Structure\"><\/span><strong>What is Array in Data Structure ?<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h1>\n\n\n\n<p>An<a href=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/\"> array in data structure<\/a> is a collection of elements that are of the same data type, where each element is uniquely accessed using its corresponding index. Elements in arrays having the same data type whether it&#8217;s integer, float and character. All elements in an array are stored in a consecutive memory location and the size of the array in data structure remains fixed during the declaration (i.e., you can\u2019t shrink or grow array size till the execution of the program ).<\/p>\n\n\n\n<p>Example : &#8211;\u00a0 1) int arr_example [6] = {56, 92, 38, 97, 90, 89} (Array of integers)<\/p>\n\n\n\n<p>Here, \u2018int\u2019 keyword represents that the array is of integer type , \u2018arr_example\u2019 represents the name of an array. This array consists of all integer elements and it is of fixed size (6).<\/p>\n\n\n\n<p>Array represents order in two forms i.e, column major order and row major order. These orders in an array are important when we go for multi-dimensional arrays to place elements like the way we represent the order of an array.<\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-full is-resized\"><img decoding=\"async\" width=\"935\" height=\"491\" src=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2024\/12\/Array-Representation-Diagram.png\" alt=\"\" class=\"wp-image-38114\" style=\"width:409px;height:auto\" srcset=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2024\/12\/Array-Representation-Diagram.png 935w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2024\/12\/Array-Representation-Diagram-300x158.png 300w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2024\/12\/Array-Representation-Diagram-768x403.png 768w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2024\/12\/Array-Representation-Diagram-800x420.png 800w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2024\/12\/Array-Representation-Diagram-150x79.png 150w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2024\/12\/Array-Representation-Diagram-696x365.png 696w\" sizes=\"(max-width: 935px) 100vw, 935px\" \/><figcaption class=\"wp-element-caption\"><strong>ARRAY REPRESENTATION IN DATA STRUCTURE<\/strong><\/figcaption><\/figure><\/div>\n\n\n<h1 class=\"wp-block-heading\" id=\"h-types-of-arrays-in-data-structure-nbsp\"><span class=\"ez-toc-section\" id=\"Types_of_Arrays_in_Data_Structure\"><\/span><strong>Types of Arrays in Data Structure&nbsp;<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h1>\n\n\n\n<p>There are different types of arrays in data structure that define according to the dimension. In this article we will mainly cover three types :&nbsp;<\/p>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"h-linear-dimensional-nbsp-array-in-data-structure-1d\"><span class=\"ez-toc-section\" id=\"Linear_Dimensional_Array_in_Data_Structure_1D\"><\/span><strong>Linear Dimensional&nbsp;Array in Data Structure (1D)<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>In a linear dimensional array data structure elements are arranged linearly and each element can be accessed using its corresponding index.<\/p>\n\n\n\n<p>Example : 1) int arr_example[6]={56, 92, 38. 97, 90, 89}<\/p>\n\n\n\n<p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;2) int arr_example[9]={ 77, 67, 90, 88, 12, 34, 09, 08, 12}<\/p>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"h-two-dimensional-array-in-data-structure-2d\"><span class=\"ez-toc-section\" id=\"Two-Dimensional_Array_in_Data_Structure_2D\"><\/span><strong>Two-Dimensional Array<\/strong> <strong>in Data Structure (2D)<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Elements in a two-dimensional array should be structured in the form of table i.e rows and columns. It\u2019s like the way you represent elements in a matrix form.<\/p>\n\n\n\n<div class=\"wp-block-group is-layout-constrained wp-block-group-is-layout-constrained\"><div class=\"wp-block-group__inner-container\">\n<p>Example :&nbsp; <strong>&nbsp; &nbsp;p1 &nbsp;  q1 &nbsp; r1<\/strong><\/p>\n\n\n\n<p><strong>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;s1&nbsp; &nbsp; t1 &nbsp; u1<\/strong><\/p>\n\n\n\n<p><strong>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;v1 &nbsp; w1 &nbsp; x1<\/strong><\/p>\n<\/div><\/div>\n\n\n\n<p>In this example mentioned above, every element is arranged in the form of a table (i.e, in rows and columns).<\/p>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"h-multiple-dimensional-array-in-data-structure\"><span class=\"ez-toc-section\" id=\"Multiple_Dimensional_Array_in_Data_Structure\"><\/span><strong>Multiple Dimensional Array<\/strong> <strong>in Data Structure<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Multiple dimensional&nbsp; arrays are the extended part of a two-dimensional array. Here we are using more than two dimensions (i.e, 3D , 4D arrays).<\/p>\n\n\n\n<p>Example : 3D array [a][b][c].<\/p>\n\n\n\n<h1 class=\"wp-block-heading\" id=\"h-memory-allocation-of-arrays-nbsp\"><span class=\"ez-toc-section\" id=\"Memory_Allocation_of_Arrays\"><\/span><strong>Memory Allocation of Arrays&nbsp;<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h1>\n\n\n\n<p>Array in data structure stores elements in a contiguous memory location and each element has its unique index for representation. Elements of an array in data structure are accessed by their unique indices (i.e, every element has their own index ) during compile-time.<\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-full is-resized\"><img decoding=\"async\" width=\"938\" height=\"529\" src=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2024\/12\/Array-Representation-1.png\" alt=\" representation of array in data structure \" class=\"wp-image-38116\" style=\"width:419px;height:auto\" srcset=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2024\/12\/Array-Representation-1.png 938w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2024\/12\/Array-Representation-1-300x169.png 300w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2024\/12\/Array-Representation-1-768x433.png 768w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2024\/12\/Array-Representation-1-745x420.png 745w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2024\/12\/Array-Representation-1-150x85.png 150w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2024\/12\/Array-Representation-1-696x393.png 696w\" sizes=\"(max-width: 938px) 100vw, 938px\" \/><\/figure><\/div>\n\n\n<p>As represented in the image above, the first block of arr_element&nbsp; having index \u20180\u2019 and arr_example[0] also represents the<strong> base address <\/strong>(i.e., memory address of the first element).<\/p>\n\n\n\n<p>In the similar way every element in the arr_example array has their unique index which is represented by an integer value and the index number of the first element starts with \u20180\u2019 like the way it is represented in the image.<\/p>\n\n\n\n<p>Every element has its own unique address and the address allocation in 1D array is calculated as:&nbsp;<\/p>\n\n\n\n<p><strong>Address of arr_example[ p ] = base address + ( p * size of each element ) [Address Allocation]<\/strong><\/p>\n\n\n\n<p>In this address allocation form mentioned above \u2018 p \u2018 represents the index of the element in an array.<\/p>\n\n\n\n<p style=\"margin-top:-26px\">Example : arr_example[ 0 ] = 1000<\/p>\n\n\n\n<p style=\"margin-top:-26px\">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;arr_example[ 5 ] = 1020<\/p>\n\n\n\n<h1 class=\"wp-block-heading\" id=\"h-operations-on-an-array-in-data-structure-nbsp\"><span class=\"ez-toc-section\" id=\"Operations_on_an_Array_in_Data_Structure\"><\/span><strong>Operations on an Array in Data Structure&nbsp;<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h1>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"h-search-operation-searching\"><span class=\"ez-toc-section\" id=\"Search_Operation_Searching\"><\/span><strong>Search Operation (Searching)<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>A Searching operation in an array is used to find a particular element .<\/p>\n\n\n\n<p style=\"margin-top:-26px\">Example : arr_example [6] = { 56, 92, 38, 97, 90, 89 }<\/p>\n\n\n\n<p style=\"margin-top:-26px\">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;  &nbsp;index_value = arr_example . index_value( 3 ) &nbsp; \/\/ It searches index value 3 i.e, 97<\/p>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"h-insertion-operation\"><span class=\"ez-toc-section\" id=\"Insertion_Operation\"><\/span><strong>Insertion Operation <\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>The insertion operation in an array data structure is used to add new elements at a specified position within the array. This operation may involve shifting existing elements to create space for the new element, depending on the position where the insertion takes place.<\/p>\n\n\n\n<p style=\"margin-top:-26px\">Example : arr_example [6] = { 56, 92, 38, 97, 90, 89 }<\/p>\n\n\n\n<p style=\"margin-top:-26px\">               arr_example ( 2, 80 ) \/\/ It inserts 80 in index number 2 .<\/p>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"h-deletion-operation\"><span class=\"ez-toc-section\" id=\"Deletion_Operation\"><\/span><strong>Deletion Operation <\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>A deletion operation is used to remove elements from a particular index of an array.<\/p>\n\n\n\n<p style=\"margin-top:-26px\">Example :&nbsp; arr_example &nbsp;[6] = { 56, 92, 38, 97, 90, 89 }<\/p>\n\n\n\n<p style=\"margin-top:-26px\">                arr_example . remove (90) \/\/ delete (remove) an element.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"h-traversing\"><span class=\"ez-toc-section\" id=\"Traversing\"><\/span><strong>Traversing<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>In traversing we are accessing each element from an array to display.<\/p>\n\n\n\n<p style=\"margin-top:-26px\">Example :   arr_example &nbsp;[6] = { 56, 92, 38, 97, 90, 89 }<\/p>\n\n\n\n<p style=\"margin-top:-26px\">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;for arr_element in arr_example<\/p>\n\n\n\n<p style=\"margin-top:-26px\">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;print <strong>arr_element&nbsp; <\/strong>\/\/&nbsp; printing an element from arr_example<\/p>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"h-sorting-operation\"><span class=\"ez-toc-section\" id=\"Sorting_Operation\"><\/span><strong>Sorting Operation<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>&nbsp;&nbsp;&nbsp;In data structures, sorting an array means arranging its elements in a specific sequence, such as in ascending order (lowest to highest) or descending order (highest to lowest).<\/p>\n\n\n\n<p style=\"margin-top:-26px\">Example :&nbsp; arr_example [6] = { 56, 92, 38, 97, 90, 89 }<\/p>\n\n\n\n<p style=\"margin-top:-26px\">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; arr_example.sort ( reverse = true )<\/p>\n\n\n\n<h1 class=\"wp-block-heading\" id=\"h-complexity-analysis-in-array-data-structure\"><span class=\"ez-toc-section\" id=\"Complexity_Analysis_in_Array_Data_Structure\"><\/span><strong>Complexity Analysis in Array Data Structure<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h1>\n\n\n\n<p>Analyzing complexity of an array in data structures is an approach that defines the difficulty of a problem via space and time complexity. It is a very important concept in algorithms to execute any program because it compares the algorithm by different input sizes. Time complexity differs when we perform different operations in an array.<\/p>\n\n\n\n<p>Here is a table below that represents the time complexity of multiple operations performed on an array.<\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td class=\"has-text-align-center\" data-align=\"center\"><strong>Operations<\/strong><\/td><td class=\"has-text-align-center\" data-align=\"center\"><strong>Time Complexity&nbsp;<\/strong><\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">Access<\/td><td class=\"has-text-align-center\" data-align=\"center\">O (1)&nbsp;<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">Linear Searching&nbsp;<\/td><td class=\"has-text-align-center\" data-align=\"center\">O (n)&nbsp;<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">Binary Searching&nbsp;<\/td><td class=\"has-text-align-center\" data-align=\"center\">O (log n)&nbsp;<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">Insertion of an element at the end<\/td><td class=\"has-text-align-center\" data-align=\"center\">O (1)&nbsp;<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">Insertion of element in the middle<\/td><td class=\"has-text-align-center\" data-align=\"center\">O (n)<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">Deletion of an element at the end&nbsp;<\/td><td class=\"has-text-align-center\" data-align=\"center\">O (1)&nbsp;<\/td><\/tr><tr><td class=\"has-text-align-center\" data-align=\"center\">Traversal<\/td><td class=\"has-text-align-center\" data-align=\"center\">O (n)<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p>The space complexity of an array is O ( p ) where \u2018p\u2019 represents the size of the array.<\/p>\n\n\n\n<p>Complexity analysis is an important approach for both experienced and beginner so that they will optimize their code and understand the algorithm for better performance.<\/p>\n\n\n\n<p>Complexity analysis of an array depends upon the type of operation performed in an array along with whether the array is static or dynamic.<\/p>\n\n\n\n<h1 class=\"wp-block-heading\" id=\"h-advantages-of-array-data-structure\"><span class=\"ez-toc-section\" id=\"Advantages_of_Array_Data_Structure\"><\/span><strong>Advantages of Array Data Structure<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h1>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"h-easy-implementation-nbsp\"><span class=\"ez-toc-section\" id=\"Easy_Implementation\"><\/span><strong>Easy Implementation&nbsp;<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Implementation of arrays in data structure is easy as compared to other data structures like linked lists, queues , stacks etc. It is very easy for beginners to understand such easy implementation and structure flow.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"h-static-size-fixed-size-of-an-array\"><span class=\"ez-toc-section\" id=\"Static_Size_Fixed_Size_of_an_Array\"><\/span><strong>Static Size ( Fixed Size of an Array)<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Static size of an array is an advantage as compared to the dynamic structures because it reduces overhead and possible memory fragmentation.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"h-flexibility-of-supporting-data-types\"><span class=\"ez-toc-section\" id=\"Flexibility_of_Supporting_Data_Types\"><\/span><strong>Flexibility of Supporting Data Types<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Arrays support multiple data types to store elements as it increases flexibility and is considered to be an application.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"h-faster-data-access\"><span class=\"ez-toc-section\" id=\"Faster_Data_Access\"><\/span><strong>Faster Data Access<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Due to the consecutive storage location of storing data in an array , accessing of elements from the array becomes faster so it becomes cache friendly and improves performance.<\/p>\n\n\n\n<h1 class=\"wp-block-heading\" id=\"h-disadvantages-of-array-data-structures\"><span class=\"ez-toc-section\" id=\"Disadvantages_of_Array_Data_Structures\"><\/span><strong>Disadvantages of Array Data Structures <\/strong><span class=\"ez-toc-section-end\"><\/span><\/h1>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"h-insertion-amp-deletion-cost\"><span class=\"ez-toc-section\" id=\"Insertion_Deletion_Cost\"><\/span><strong>Insertion &amp; Deletion Cost<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Adding or removing elements in an array is time consuming as it increases cost during insertion and deletion operation.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"h-built-in-methods\"><span class=\"ez-toc-section\" id=\"Built-in_Methods\"><\/span><strong>Built-in Methods<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Arrays does not have advanced built-in methods for performing searching or insertion operations as compared to advanced data structures like ArrayList in Java programming language.<\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-large\"><a href=\"https:\/\/chat.whatsapp.com\/GZYuRkYZpuC4BJfrrHvv9J\"><img loading=\"lazy\" decoding=\"async\" width=\"1024\" height=\"159\" src=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/01\/DSAWHATSAPPBANNER-2-18-1024x159.jpg\" alt=\"\" class=\"wp-image-41469\" srcset=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/01\/DSAWHATSAPPBANNER-2-18-1024x159.jpg 1024w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/01\/DSAWHATSAPPBANNER-2-18-300x47.jpg 300w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/01\/DSAWHATSAPPBANNER-2-18-768x119.jpg 768w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/01\/DSAWHATSAPPBANNER-2-18-1536x238.jpg 1536w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/01\/DSAWHATSAPPBANNER-2-18-2048x317.jpg 2048w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/01\/DSAWHATSAPPBANNER-2-18-150x23.jpg 150w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/01\/DSAWHATSAPPBANNER-2-18-696x108.jpg 696w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/01\/DSAWHATSAPPBANNER-2-18-1068x166.jpg 1068w, https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/01\/DSAWHATSAPPBANNER-2-18-1920x298.jpg 1920w\" sizes=\"(max-width: 1024px) 100vw, 1024px\" \/><\/a><\/figure><\/div>\n\n\n<h1 class=\"wp-block-heading\" id=\"h-conclusion\"><span class=\"ez-toc-section\" id=\"Conclusion\"><\/span><strong>Conclusion <\/strong><span class=\"ez-toc-section-end\"><\/span><\/h1>\n\n\n\n<p>In this article we have discussed the most important topics that help to understand the basics and complexity analysis of an array in data structure.&nbsp;<\/p>\n\n\n\n<p>Along with examples it becomes very easy for beginners in data structures to understand the actual definition and basics of an array. By understanding arrays in data structures&nbsp; programmers can easily solve a wide range of computational problems&nbsp; and optimize solutions for better performance.<\/p>\n\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>In the era of computer science, managing and handling data is important to build powerful and adaptable applications. There are various data structures available to manage and organize data.&nbsp; An array in data structure is a collection of elements that are of the same data type, where each element is uniquely accessed using its corresponding [&hellip;]<\/p>\n","protected":false},"author":560,"featured_media":38168,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1075,1073],"tags":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO Premium plugin v21.4 (Yoast SEO v21.9.1) - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Array in Data Structure : Types and Complexity Analysis - iQuanta<\/title>\n<meta name=\"description\" content=\"An array in data structure is a collection of elements that are of the same data type, where each element is uniquely accessed using index.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Array in Data Structure : Types and Complexity Analysis\" \/>\n<meta property=\"og:description\" content=\"An array in data structure is a collection of elements that are of the same data type, where each element is uniquely accessed using index.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/\" \/>\n<meta property=\"og:site_name\" content=\"iQuanta\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/facebook.com\/iquanta.in\" \/>\n<meta property=\"article:published_time\" content=\"2025-06-30T06:26:11+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2025-06-30T06:26:14+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2024\/12\/Array-Feature-Image.jpeg\" \/>\n\t<meta property=\"og:image:width\" content=\"1600\" \/>\n\t<meta property=\"og:image:height\" content=\"900\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/jpeg\" \/>\n<meta name=\"author\" content=\"Nidhi Goswami\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Nidhi Goswami\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"7 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/\"},\"author\":{\"name\":\"Nidhi Goswami\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/#\/schema\/person\/ec8c8c25d0526dd86557b6fed064f7f3\"},\"headline\":\"Array in Data Structure : Types and Complexity Analysis\",\"datePublished\":\"2025-06-30T06:26:11+00:00\",\"dateModified\":\"2025-06-30T06:26:14+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/\"},\"wordCount\":1442,\"publisher\":{\"@id\":\"https:\/\/www.iquanta.in\/blog\/#organization\"},\"articleSection\":[\"DSA and Competitive Programming\",\"iSkills\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/\",\"url\":\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/\",\"name\":\"Array in Data Structure : Types and Complexity Analysis - iQuanta\",\"isPartOf\":{\"@id\":\"https:\/\/www.iquanta.in\/blog\/#website\"},\"datePublished\":\"2025-06-30T06:26:11+00:00\",\"dateModified\":\"2025-06-30T06:26:14+00:00\",\"description\":\"An array in data structure is a collection of elements that are of the same data type, where each element is uniquely accessed using index.\",\"breadcrumb\":{\"@id\":\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/www.iquanta.in\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Array in Data Structure : Types and Complexity Analysis\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/#website\",\"url\":\"https:\/\/www.iquanta.in\/blog\/\",\"name\":\"iQuanta | Cat Preparation Online\",\"description\":\"Building Learning Networks\",\"publisher\":{\"@id\":\"https:\/\/www.iquanta.in\/blog\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/www.iquanta.in\/blog\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/#organization\",\"name\":\"IQuanta\",\"url\":\"https:\/\/www.iquanta.in\/blog\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2018\/08\/IQuanta-1.png\",\"contentUrl\":\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2018\/08\/IQuanta-1.png\",\"width\":525,\"height\":200,\"caption\":\"IQuanta\"},\"image\":{\"@id\":\"https:\/\/www.iquanta.in\/blog\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/facebook.com\/iquanta.in\"]},{\"@type\":\"Person\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/#\/schema\/person\/ec8c8c25d0526dd86557b6fed064f7f3\",\"name\":\"Nidhi Goswami\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/www.iquanta.in\/blog\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/21d234d87afd924b217d26b25a3cf1ee?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/21d234d87afd924b217d26b25a3cf1ee?s=96&d=mm&r=g\",\"caption\":\"Nidhi Goswami\"},\"url\":\"https:\/\/www.iquanta.in\/blog\/author\/nidhigoswami\/\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"Array in Data Structure : Types and Complexity Analysis - iQuanta","description":"An array in data structure is a collection of elements that are of the same data type, where each element is uniquely accessed using index.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/","og_locale":"en_US","og_type":"article","og_title":"Array in Data Structure : Types and Complexity Analysis","og_description":"An array in data structure is a collection of elements that are of the same data type, where each element is uniquely accessed using index.","og_url":"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/","og_site_name":"iQuanta","article_publisher":"https:\/\/facebook.com\/iquanta.in","article_published_time":"2025-06-30T06:26:11+00:00","article_modified_time":"2025-06-30T06:26:14+00:00","og_image":[{"width":1600,"height":900,"url":"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2024\/12\/Array-Feature-Image.jpeg","type":"image\/jpeg"}],"author":"Nidhi Goswami","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Nidhi Goswami","Est. reading time":"7 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#article","isPartOf":{"@id":"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/"},"author":{"name":"Nidhi Goswami","@id":"https:\/\/www.iquanta.in\/blog\/#\/schema\/person\/ec8c8c25d0526dd86557b6fed064f7f3"},"headline":"Array in Data Structure : Types and Complexity Analysis","datePublished":"2025-06-30T06:26:11+00:00","dateModified":"2025-06-30T06:26:14+00:00","mainEntityOfPage":{"@id":"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/"},"wordCount":1442,"publisher":{"@id":"https:\/\/www.iquanta.in\/blog\/#organization"},"articleSection":["DSA and Competitive Programming","iSkills"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/","url":"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/","name":"Array in Data Structure : Types and Complexity Analysis - iQuanta","isPartOf":{"@id":"https:\/\/www.iquanta.in\/blog\/#website"},"datePublished":"2025-06-30T06:26:11+00:00","dateModified":"2025-06-30T06:26:14+00:00","description":"An array in data structure is a collection of elements that are of the same data type, where each element is uniquely accessed using index.","breadcrumb":{"@id":"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.iquanta.in\/blog\/array-in-data-structure-types-and-complexity-analysis\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.iquanta.in\/blog\/"},{"@type":"ListItem","position":2,"name":"Array in Data Structure : Types and Complexity Analysis"}]},{"@type":"WebSite","@id":"https:\/\/www.iquanta.in\/blog\/#website","url":"https:\/\/www.iquanta.in\/blog\/","name":"iQuanta | Cat Preparation Online","description":"Building Learning Networks","publisher":{"@id":"https:\/\/www.iquanta.in\/blog\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.iquanta.in\/blog\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/www.iquanta.in\/blog\/#organization","name":"IQuanta","url":"https:\/\/www.iquanta.in\/blog\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.iquanta.in\/blog\/#\/schema\/logo\/image\/","url":"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2018\/08\/IQuanta-1.png","contentUrl":"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2018\/08\/IQuanta-1.png","width":525,"height":200,"caption":"IQuanta"},"image":{"@id":"https:\/\/www.iquanta.in\/blog\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/facebook.com\/iquanta.in"]},{"@type":"Person","@id":"https:\/\/www.iquanta.in\/blog\/#\/schema\/person\/ec8c8c25d0526dd86557b6fed064f7f3","name":"Nidhi Goswami","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.iquanta.in\/blog\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/21d234d87afd924b217d26b25a3cf1ee?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/21d234d87afd924b217d26b25a3cf1ee?s=96&d=mm&r=g","caption":"Nidhi Goswami"},"url":"https:\/\/www.iquanta.in\/blog\/author\/nidhigoswami\/"}]}},"_links":{"self":[{"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/posts\/38112"}],"collection":[{"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/users\/560"}],"replies":[{"embeddable":true,"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/comments?post=38112"}],"version-history":[{"count":8,"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/posts\/38112\/revisions"}],"predecessor-version":[{"id":52907,"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/posts\/38112\/revisions\/52907"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/media\/38168"}],"wp:attachment":[{"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/media?parent=38112"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/categories?post=38112"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.iquanta.in\/blog\/wp-json\/wp\/v2\/tags?post=38112"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}