Is linked list faster than array?
- 1 Answers
- 942 Views
- I also Faced
- E-Mail Answers
Answer / Krishna Chaursiya
Linked lists have an average time complexity of O(1) for insertions and deletions at the end, while arrays have a constant time complexity of O(1) for accessing elements by index. However, arrays are generally faster for operations like random access because they use contiguous memory blocks.
| Is This Answer Correct ? | 0 Yes | 0 No |
What is b tree in data structure?
How do we find duplicate elements in an array?
Which sorting algorithm uses minimum number of swaps?
Explain linked list in short.
What is data structure and why we need them?
Write an algorithm for inserting and deleting an element from doubly linked list?
How do I start preparing for placement?
What do you mean by articulation point?
How to initialize Dictionary using collection initialize?
What are the benefits of using arrays?
Which algorithm is used in collections sort method?
which is the simplest file structure? (Sequential, indexed, random)
Windows 
