Open Access Open Access  Restricted Access Subscription or Fee Access

Array in Data Structure

Shweta Joshi


It is normally seen that algorithms are more important than array but in reality, it's inversely important to break computation al problems this article, we've explored Array Data Structure in dept. We explore crucial ideas in Array and how we develop our own custom array with different way sofit sutilisation. This work attempts to provide insight on the operation of data structures in the context of information organisation. Information storage and retrieval is a field of research that is rising in prominence as the necessity and desire for sharing and studying information grows. Data structures have been the area of interest for many researchers for a long period in the era of data management and retrieval. The necessity for appropriate data structures has become increasingly crucial as data expands at an exponential rate. In today’s era, people are so addicted with the devices such as mobile phones or computers which produce large amount of the data difficult for storage. Data structures are essential components of computers that are used to organise, process, access, and store data in order for it to be used efficiently. This document

Full Text:



Carey MJ, Ceri S, Bernstein P, Dayal U, Faloutsos C, Freytag JC, Gardarin G, Jonker W, Krishnamurthy V, Neimat MA, Valduriez P. Data-Centric Systems and Applications. Italy: Springer. 2006.

Kanagavalli VR, Maheeja G. A study on the usage of data structures in information retrieval. arXiv preprint arXiv:1602.07799. 2016 Feb 25.

Geeks for Geeks. Real-time application of Data Structures[Online].Available from

Alumbaugh TJ, Jiao X. Compact array-based mesh data structures. InProceedings of the 14th International Meshing Roundtable 2005 (pp. 485-503). Springer, Berlin, Heidelberg.

Combemale B, Kienzle J, Mussbacher G, Ali H, Amyot D, Bagherzadeh M, Batot E, Bencomo N, Benni B, Bruel JM, Cabot J. A Hitchhiker's Guide to Model-Driven Engineering for Data-Centric Systems. IEEE Software. 2020 May 15; 38(4): 71-84.

Ferragina P, Manzini G. Opportunistic data structures with applications. InProceedings 41st annual symposium on foundations of computer science 2000 Nov 12 (pp. 390-398). IEEE.

Ferragina P, Grossi R. The string B-tree: A new data structure for string search in external memory and its applications. Journal of the ACM (JACM). 1999 Mar 1; 46 (2): 236-80.

Abel DJ, Smith JL. A data structure and algorithm based on a linear key for a rectangle retrieval problem. Computer vision, graphics, and image processing. 1983 Oct 1; 24(1): 1-3

Kalantari I, McDonald G. A data structure and an algorithm for the nearest point problem. IEEE Transactions on Software Engineering. 1983 Sep (5): 631-4.



  • There are currently no refbacks.