Why collections over arrays in C Sharp (C#) - Performance Analysis

Time Complexity: Why collections over arrays

O(n)

Understanding Time Complexity

We want to understand how using collections instead of arrays affects the time it takes to do common tasks.

How does the choice between arrays and collections change the work done as data grows?

Scenario Under Consideration

Analyze the time complexity of adding elements to an array versus a List<T> collection.

int[] numbers = new int[5];
for (int i = 0; i < 5; i++)
{
    numbers[i] = i;
}

List<int> numberList = new List<int>();
for (int i = 0; i < 5; i++)
{
    numberList.Add(i);
}
    

This code fills a fixed-size array and a dynamic list with 5 numbers each.

Identify Repeating Operations

Look at the loops and operations that repeat as we add items.

• Primary operation: Assigning or adding an element inside a loop.
• How many times: Exactly 5 times for both array and list in this example.

How Execution Grows With Input

As we add more items, the array assignment stays simple but the list may need extra work.

Input Size (n)	Approx. Operations for Array	Approx. Operations for List
10	10 assignments	About 10 adds, some resizing
100	100 assignments	About 100 adds, several resizes
1000	1000 assignments	About 1000 adds, multiple resizes

Array operations grow directly with input size. List operations also grow but resizing causes extra work sometimes.

Final Time Complexity

Time Complexity: O(n)

This means both array and list take time proportional to the number of items added, but lists handle resizing behind the scenes.

Common Mistake

[X] Wrong: "Adding to a List is always slower than arrays because of resizing overhead."

[OK] Correct: Lists resize only occasionally, so most adds are fast. Over many adds, the average time per add stays low.

Interview Connect

Understanding how collections manage time costs helps you explain why they are often preferred over arrays for flexible data. This skill shows you think about efficiency and practical coding.

Self-Check

What if we changed the List to a LinkedList? How would the time complexity of adding elements change?

Practice

1. Why might you choose a collection like List<T> over an array in C#?

easy

A. Because collections can change size dynamically while arrays have fixed size.

B. Because arrays have more built-in methods than collections.

C. Because collections use less memory than arrays.

D. Because arrays can store different data types in the same array.

Solution

1. Step 1: Understand array size behavior

   Arrays in C# have a fixed size once created and cannot grow or shrink.

2. Step 2: Understand collection size behavior

   Collections like List<T> can dynamically add or remove items, changing their size.

3. Final Answer:

   Because collections can change size dynamically while arrays have fixed size. -> Option A

4. Quick Check:

   Collections grow/shrink; arrays fixed size [OK]

Hint: Remember: arrays fixed size, collections flexible size [OK]

Common Mistakes:

• Thinking arrays can resize automatically
• Believing collections use less memory always
• Confusing data type storage capabilities

2. Which of the following is the correct way to declare a collection that can grow in size in C#?

easy

A. int[] numbers = new int[5];

B. List<int> numbers = new List<int>();

C. int numbers = new List<int>();

D. ArrayList numbers = new int[5];

Solution

1. Step 1: Check syntax for array declaration

   int[] numbers = new int[5]; declares a fixed-size array, not a collection.

2. Step 2: Check syntax for collection declaration

   List<int> numbers = new List<int>(); correctly declares a generic list collection that can grow.

3. Final Answer:

   List<int> numbers = new List<int>(); -> Option B

4. Quick Check:

   List<T> syntax is for growable collections [OK]

Hint: Use List<T> for growable collections, arrays need size upfront [OK]

Common Mistakes:

• Using array syntax when collection is needed
• Assigning wrong types to variables
• Confusing ArrayList with arrays

3. What will be the output of this C# code?

List<int> nums = new List<int>() {1, 2, 3};
nums.Add(4);
Console.WriteLine(nums.Count);

medium

A. Compilation error

B. 3

C. 0

D. 4

Solution

1. Step 1: Understand initial list size

   The list nums starts with 3 elements: 1, 2, 3.

2. Step 2: Analyze the Add method effect

   Calling nums.Add(4); adds one more element, increasing count to 4.

3. Final Answer:

   4 -> Option D

4. Quick Check:

   List.Count reflects added elements [OK]

Hint: Add increases collection size; Count shows current size [OK]

Common Mistakes:

• Assuming Count stays 3 after Add
• Confusing Count with capacity
• Expecting compilation error due to Add

4. Identify the error in this code snippet:

int[] arr = new int[3];
arr.Add(5);

medium

A. Array size must be declared as 5.

B. int[] cannot store integers.

C. Arrays do not have an Add method.

D. The array must be initialized with values.

Solution

1. Step 1: Check array methods

   Arrays in C# do not have an Add method; this method belongs to collections like List.

2. Step 2: Understand array limitations

   Arrays have fixed size and cannot add elements dynamically.

3. Final Answer:

   Arrays do not have an Add method. -> Option C

4. Quick Check:

   Arrays lack Add method [OK]

Hint: Arrays fixed size, no Add method; use List for adding [OK]

Common Mistakes:

• Trying to add elements to arrays
• Confusing array size with element count
• Assuming arrays have collection methods

5. You need to store a list of user names that can change during program execution. Which approach is best and why?

hard

A. Use a List<string> because it can grow and shrink as users are added or removed.

B. Use an array because it is faster and fixed size is enough.

C. Use a fixed-size array and recreate it every time the list changes.

D. Use a string variable to store all names separated by commas.

Solution

1. Step 1: Analyze data size flexibility needs

   User names list changes size, so fixed size arrays are inconvenient.

2. Step 2: Choose collection type for dynamic data

   List<string> allows adding/removing names easily without recreating the structure.

3. Final Answer:

   Use a List<string> because it can grow and shrink as users are added or removed. -> Option A

4. Quick Check:

   Dynamic data needs collections like List [OK]

Hint: Dynamic data? Use List<T> for easy resizing [OK]

Common Mistakes:

• Choosing fixed arrays for changing data
• Using strings to store multiple values unsafely
• Recreating arrays repeatedly instead of collections