Open Access
This is an unedited manuscript accepted for publication and provided as an Article in Press for early access at the author’s request. The article will undergo copyediting, typesetting, and galley proof review before final publication. Please be aware that errors may be identified during production that could affect the content. All legal disclaimers of the journal apply.
Md Ajmal Hussain,
Jigar Pandya,
Poonam Chakravarty,
- Student, Department of Computer Science, Rai School of Engineering Rai University, Ahmedabad, Gujarat, India
- Assistant Professor, Computer Science Department, Rai University, Ahmedabad, Gujarat, India
- Assistant Professor, CSE/IT Department, Rai University, Ahmedabad, Gujarat, India
Abstract document.addEventListener(‘DOMContentLoaded’,function(){frmFrontForm.scrollToID(‘frm_container_abs_111496’);});Edit Abstract & Keyword
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 structures 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 (ijdss)]
Md Ajmal Hussain, 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):-.
Md Ajmal Hussain, 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):-. Available from: https://journals.stmjournals.com/ijdss/article=2024/view=0
References
document.addEventListener(‘DOMContentLoaded’,function(){frmFrontForm.scrollToID(‘frm_container_ref_111496’);});Edit
- Akinde Aderonke O, Okolie Samuel O, Kuyoro‘Shade O. The S-Linked List–A Variant of The Linked List Data Structure. Journal of Emerging Trends in Computing and Information Sciences. 2013;4(6):571-576.
- C. Agrawal, Sanjay Singh, Arun Kumar Gautam, Mahesh Kumar Singh. Basic Concept of Embedded ‘C’: Review. International Journal of Computer Science and Informatics. 2012;1(4):290-294.
- Azar E, Alebicto ME. Swift data structure and algorithms. Packt Publishing Ltd; 2016 Nov 18.
- Akinde Aderonke O, Okolie Samuel O, Kuyoro‘Shade O. The S-Linked List–A Variant Of The Linked List Data Structure. Journal of Emerging Trends in Computing and Information Sciences. 2013 Jun;4(6).
- Mridha P, Datta BK. An Algorithm for Analysis the Time Complexity for Iterated Local Search (ILS). Journal of Research in Applied Mathematics. 2021;7(6):52-4.
- Mir Omranudin Abhar, Nisha Gatuam. A REVIEW DATA STRUCTURE , ALGORITHMS & ANALYSIS. Journal of Emerging Technologies and Innovative Research. 2019;6(6):59-64.
- Complete Guide On Complexity Analysis Data Structure and Algorithms Tutorial. 2023. 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. In2022 International Conference on Data Science, Agents & Artificial Intelligence (ICDSAAI) 2022 Dec 8 (Vol. 1, pp. 1-6). IEEE.
- Aryan Singh Chauhan. A COMPARATIVE STUDY OF VARIOUS SORTS OF DATA STRUCTURES. International Research Journal of Modernization in Engineering Technology and Science. 2021;03(05):3011-3016.
- Renuka Devi. Analysis of Arraylist and Linked list. International Journal of Computer Sciences and Engineering. 2019;7(5):1566-1570.
- Shastri S, Mansotra V, Bhadwal AS, Kumari M, Khajuria A, Jasrotia DS. A GUI Based Run-Time Analysis of SortingAlgorithms and their Comparative Study. International Journal of Computer Sciences and Engineering. 2017;5(11):217-21.
| Volume | 02 |
| Issue | 02 |
| Received | 05/03/2024 |
| Accepted | 16/10/2024 |
| Published | 07/11/2024 |
function myFunction2() {
var x = document.getElementById(“browsefigure”);
if (x.style.display === “block”) {
x.style.display = “none”;
}
else { x.style.display = “Block”; }
}
document.querySelector(“.prevBtn”).addEventListener(“click”, () => {
changeSlides(-1);
});
document.querySelector(“.nextBtn”).addEventListener(“click”, () => {
changeSlides(1);
});
var slideIndex = 1;
showSlides(slideIndex);
function changeSlides(n) {
showSlides((slideIndex += n));
}
function currentSlide(n) {
showSlides((slideIndex = n));
}
function showSlides(n) {
var i;
var slides = document.getElementsByClassName(“Slide”);
var dots = document.getElementsByClassName(“Navdot”);
if (n > slides.length) { slideIndex = 1; }
if (n (item.style.display = “none”));
Array.from(dots).forEach(
item => (item.className = item.className.replace(” selected”, “”))
);
slides[slideIndex – 1].style.display = “block”;
dots[slideIndex – 1].className += ” selected”;
}