Jigar Pandya,
Poonam Chakravarty,
- Assistant Professor, Department of Computer Science, Rai University, Ahmedabad, Gujarat, India
- Assistant Professor, Department of CSE/IT, Rai University, Ahmedabad, Gujarat, India
Abstract
Data structures are techniques for maintaining, manipulating, and storing data on a computer, enabling efficient access and modification. They support various operations, such as insertion, deletion, updating, and sorting. Examples of data structure include arrays, linked lists, graphs, heaps, stacks, and queues. Each data structure is designed to meet specific needs and solve particular problems. Typically, we identify the problem, devise a solution as an algorithm, and then write an efficient program. The program should be optimized for both time and space efficiency, which is why understanding ‘time complexity’ is essential. Time complexity measures the total execution time a program takes to complete and is expressed using Big O notation. Efficient data handling is crucial in modern computing applications, making it essential to understand the concept of time complexity in data structures. Time complexity measures the computational resources required by algorithms in relation to the size of their input. This abstract explores the fundamental time complexities of common data structures, offering insights into their operational efficiencies.
Keywords: Data structure, array and linked list, algorithm, time complexity
[This article belongs to International Journal of Data Structure Studies ]
Jigar Pandya, Poonam Chakravarty. Impact of Time Complexity Using Array and Linked List in Data Structure. International Journal of Data Structure Studies. 2024; 02(02):41-48.
Jigar Pandya, Poonam Chakravarty. Impact of Time Complexity Using Array and Linked List in Data Structure. International Journal of Data Structure Studies. 2024; 02(02):41-48. Available from: https://journals.stmjournals.com/ijdss/article=2024/view=181593
References
- Akinde Aderonke O, Okolie Samuel O, Kuyoro’Shade O. The S-linked list–A variant of the linked list data structure. J Emerg Trends Comput Inf Sci. 2013;4:571–6.
- Agrawal SC, Singh S, Gautam AK, Singh MK. Basic concept of embedded ‘C’. Int J Comput Sci Inform. 2012;1:290–4.
- Azar E, Alebicto ME. Swift Data Structure and Algorithms. Birmingham, United Kingdom: Packt Publishing Ltd.; 2016.
- Mühlberg JT, White DH, Dodds M, Lüttgen G, Piessens F. Learning assertions to verify linked-list programs. In: Calinescu R, Rumpe B, editors. Software Engineering and Formal Methods. SEFM 2015. Lecture Notes in Computer Science. Vol. 9276. Cham: Springer; 2015. p. 37–52. DOI: 10.1007/978-3-319-22969-0_3.
- Mridha P, Datta BK. An algorithm for analysis the time complexity for iterated local search (ILS). Res Appl Math. 2021;7:52–4.
- Abhar MO, Gatuam N. A review data structure, algorithms & analysis. J Emerg Technol Innov Res. 2019;6:59–64.
- GeeksforGeeks. (2023). Complete guide on complexity analysis data structure and algorithms tutorial [Online]. GeeksforGeeks. Available from: https://www.geeksforgeeks.org/complete-guide-on-complexity-analysis/.
- Lokeshwar B, Zaid MM, Naveen S, Venkatesh J, Sravya L. Analysis of time and space complexity of array, linked list and linked array (hybrid) in linear search operation. 2022 International Conference on Data Science, Agents & Artificial Intelligence (ICDSAAI), Chennai, India. 2022. p. 1–6. DOI: 10.1109/ICDSAAI55433.2022.10028872.
- Singh Chauhan A. A comparative study of various sorts of data structures. Int Res J Mod Eng Technol Sci. 2021;3:3011–6.
- Devi KR. Analysis of arraylist and linked list. Int J Comput Sci Eng. 2019;7:1566–70. DOI: 10.26438/ijcse/v7i5.15661570.
- Shastri S, Mansotra V, Bhadwal AS, Kumari M, Khajuria A, Singh DS. A GUI based run-time analysis of sorting algorithms and their comparative study. Int J Comput Sci Eng. 2017;5:217–21. DOI: 10.26438/ijcse/v5i11.217221.
| Volume | 02 |
| Issue | 02 |
| Received | 05/03/2024 |
| Accepted | 16/10/2024 |
| Published | 07/11/2024 |
Login
PlumX Metrics