Services
Technology Web App Development Mobile App Development Windows App Development Database Development UI/UX Development Cloud Development SEO Digital Marketing Guest Posting Content Writing Artificial Intelligence Data Science ERP Development CRM Development CMS Development LMS Development Business Listing Blockchain Technology Startup Promotion
Products
Data Converter Cleaner TUC - Unit Converter Import Export Survey Manager Tweet Controller
Developer
Article Blog Forum Interview Beginner News Startup Quiz
Users
Career
Apply Job Internship
Pricing
Login Sign Up Get a Quote

forum

home / developersection / forums / when to use linkedlist over arraylist in c#?
Ask Question
Utpal Vishwas
Utpal Vishwas

Student

I am Utpal Vishwas from Uttar Pradesh. Have completed my B. Tech. course from MNNIT campus Prayagraj in 2022. I have good knowledge of computer networking.

Message

1 Answers

Aryan Kumar
Aryan Kumar 23 Aug 2023
Report Abuse

Here are some of the cases when you might want to use a linked list over an ArrayList in C#:

  • When you need to frequently insert or delete elements from the list.
  • When you need to keep the list sorted.
  • When you need to traverse the list in both directions.
  • When you need to represent a queue or stack data structure.
  • When you need to save memory.

Here are some of the cases when you might want to use an ArrayList over a linked list in C#:

  • When you need to access elements in the list by their index.
  • When you need to iterate over the list in a loop.
  • When you need to add or remove elements from the list in a random order.
  • When you need to represent a dynamic array data structure.
  • When you need to perform efficient random access operations on the list.

Ultimately, the best choice for a particular application depends on the specific needs of the application.

Here are some additional things to consider when choosing between a linked list and an ArrayList:

  • Linked lists are more memory efficient than ArrayLists, because they only store the references to the next and previous nodes in the list. ArrayLists, on the other hand, store the actual elements in the list.
  • Linked lists are slower than ArrayLists for accessing elements by index, because they need to traverse the list to find the element. ArrayLists can access elements by index directly.
  • Linked lists are more flexible than ArrayLists, because they can grow or shrink as needed. ArrayLists have a fixed size.
MindStick Training