In the concept of data structures, the List plays a major role in the allocation of data. “A list in java is an interface that can extend to collection interface”. A list can be implemented in two ways: Array list and Linked list. Array list is a class which provides growable array of list ADT. Linked list provides different implementation of the List ADT. There are different kinds of linked lists support in data structures which could be singly linked list, doubly linked list and circularly linked list. This paper deals with the analysis of array list and linked list (i.e.) singly linked list by performing operations such as insertion, deletion, searching and provides results based on time complexity to decide which would be better and efficient for allocation of data.

list, arraylist, linkedlist, data structure

[1] Stelios Xinogalos, Maya Satratzemi, “An analysis of students’ difficulties with ArrayList object collections and proposals for supporting the learning process”, In the Proceedings of the 2008 IEEE International Conference on Advanced Learning Technologies, Cantabria, Spain, pp. 180-182, 2008.
[2] Gaifang Dong, Xueliang Fu, “An Improved Pathfinding Algorithm Based on Sorted Linked List and Indexed Array”, IEEE Transaction, Vol.6, Issue.4, pp.978-981, 2008.
[3] Anshu Yadav, Aruna Bhat, Rajni Jindal, “Stack implementation of adjacency list for representation of graphs”, In the Proceedings of the 2008 IEEE International Conference on Advanced Learning Technologies, Noida, Uttar Pradesh, India, pp. 213-216, 2013.
[4] Shruti rishab panday, “A Heuristic Approach of Sorting Using Linked List”, In the Proceedings of the IEEE Second International Conference on Computing Methodologies and Communication, Erode,India, pp. 446-450, 2018.
[5] Karuna, Garina Gupta, “Dynamic Implementation Using Linked List”, International Journal of Engineering Research & Management Technology”, Vol.1, Issue.5, pp.44-48, 2014.
[6] H. C Thomas, E. L Charles, L. R Ronald, and S. Clitlord, “Introduction to Algorithms”, Second Edition, MIT Press and 609 McGraw- Hill, ISBN 0-262-03293- 7. Section 1.1 Algorithms, pp.5, 2001.
[7] W.H. Butt, and M. Y. Javed, “A New Relative Sort Algorithm based on mean value”. IEEE Conference on Multi topic, 2008.
[8] Devareddi Ravi Babu, R Shiva Shankar, V Pradeep Kumar, Chinta Someswara Rao, D Madhu Babu, V Chandra Sekhar, “Array-Indexed Sorting Algorithm for natural numbers”, IEEE, pp. 606-609,2011.
[9] Wong, J., Vernon, A. Field, J., “Evaluation of a Path-Finding Algorithm for Interconnected Local Area Networks”, Selected Areas in Communications, pp. 1463-1470, 1987.
[10] Nagendra Singh, “Role of Suffix Array in String Matching: A Comparative Analysis”, International Journal of Computer Sciences and Engineering, Vol. 3, Issue.6, pp.89-93, 2015.
[11] Sourabh Shastri, “A GUI Based Run-Time Analysis of Sorting Algorithms and their Comparative Study”, International Journal of Computer Sciences and Engineering, Vol. 5, Issue.11, pp.217-221, 2017.
[12] A.Chitra, P.T. Rajan, “Data Structures”, second edition, 2007.