Comparison Based vs Non Comparison Based Sorting in DSA C# - Complexity Comparison

Time Complexity: Comparison Based vs Non Comparison Based Sorting

O(n²) for comparison based, O(n + k) for non comparison based

Understanding Time Complexity

Sorting is a common task where we arrange items in order. Different sorting methods take different times depending on how they work.

We want to understand how the time needed grows as the list gets bigger.

Scenario Under Consideration

Analyze the time complexity of these two sorting approaches.

// Comparison based sorting example (Bubble Sort)
void BubbleSort(int[] arr) {
  int n = arr.Length;
  for (int i = 0; i < n - 1; i++) {
    for (int j = 0; j < n - i - 1; j++) {
      if (arr[j] > arr[j + 1]) {
        int temp = arr[j];
        arr[j] = arr[j + 1];
        arr[j + 1] = temp;
      }
    }
  }
}

// Non-comparison based sorting example (Counting Sort)
void CountingSort(int[] arr, int maxVal) {
  int[] count = new int[maxVal + 1];
  foreach (int num in arr) count[num]++;
  int index = 0;
  for (int i = 0; i < count.Length; i++) {
    while (count[i]-- > 0) {
      arr[index++] = i;
    }
  }
}
    

Bubble Sort compares elements to sort, Counting Sort uses counts of values without direct comparisons.

Identify Repeating Operations

Look at what repeats in each method.

• Bubble Sort: Two nested loops comparing pairs of elements.
• Counting Sort: One loop counting elements, one loop rebuilding the array.
• Dominant operation: Bubble Sort's nested comparisons dominate time; Counting Sort's counting and rebuilding loops dominate.

How Execution Grows With Input

How does time grow as list size (n) grows?

Input Size (n)	Bubble Sort Ops (approx.)	Counting Sort Ops (approx.)
10	100 (10*10)	~20 (10 + maxVal)
100	10,000 (100*100)	~200 (100 + maxVal)
1000	1,000,000 (1000*1000)	~2000 (1000 + maxVal)

Bubble Sort time grows much faster (squares) than Counting Sort (linear), if maxVal is not too big.

Final Time Complexity

Time Complexity: O(n²) for comparison based (Bubble Sort), O(n + k) for non-comparison based (Counting Sort), where k is the range of input values.

This means Bubble Sort gets much slower as list grows, but Counting Sort can be faster if the value range is small.

Common Mistake

[X] Wrong: "All sorting methods take about the same time because they all sort the list."

[OK] Correct: Different methods use different steps; some compare many pairs, others count values. This changes how time grows with list size.

Interview Connect

Knowing how sorting methods differ helps you choose the right one and explain your choice clearly. This skill shows you understand how algorithms work in real situations.

Self-Check

"What if the input values for Counting Sort are very large compared to the list size? How would that affect the time complexity?"

Practice

1. Which of the following sorting algorithms is non-comparison based?

easy

A. Merge Sort

B. Quick Sort

C. Counting Sort

D. Heap Sort

Solution

1. Step 1: Understand comparison based sorting

   Comparison based sorting algorithms decide order by comparing elements, like Merge Sort, Quick Sort, and Heap Sort.

2. Step 2: Identify non-comparison based sorting

   Counting Sort uses counting frequencies and does not compare elements directly.

3. Final Answer:

   Counting Sort -> Option C

4. Quick Check:

   Non-comparison based = Counting Sort [OK]

Hint: Non-comparison sorts use counting or buckets, not element comparisons [OK]

Common Mistakes:

• Confusing Quick Sort as non-comparison
• Thinking Heap Sort is non-comparison
• Assuming all sorts compare elements

2. Which of the following is the correct syntax to call Radix Sort method named RadixSort on an integer array arr in C#?

easy

A. RadixSort(arr);

B. arr.RadixSort();

C. RadixSort<int>(arr);

D. RadixSort arr;

Solution

1. Step 1: Understand method call syntax in C#

   Calling a static method with an array argument uses method name and parentheses with the array inside.

2. Step 2: Analyze options

   RadixSort(arr); uses correct syntax: RadixSort(arr); arr.RadixSort(); tries to call as instance method which is incorrect unless defined so. RadixSort<int>(arr); uses generic syntax unnecessarily. RadixSort arr; is invalid syntax.

3. Final Answer:

   RadixSort(arr); -> Option A

4. Quick Check:

   Static method call = RadixSort(arr); [OK]

Hint: Static method calls use MethodName(args) syntax [OK]

Common Mistakes:

• Using instance method call on array
• Adding unnecessary generic syntax
• Writing invalid declaration instead of call

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

int[] arr = {4, 2, 2, 8, 3, 3, 1};
CountingSort(arr);
Console.WriteLine(string.Join(", ", arr));

void CountingSort(int[] array) {
    int max = array.Max();
    int[] count = new int[max + 1];
    foreach (int num in array) count[num]++;
    int index = 0;
    for (int i = 0; i <= max; i++) {
        while (count[i] > 0) {
            array[index++] = i;
            count[i]--;
        }
    }
}

medium

A. 8, 4, 3, 3, 2, 2, 1

B. 1, 2, 2, 3, 3, 4, 8

C. 4, 2, 2, 8, 3, 3, 1

D. 1, 1, 2, 2, 3, 3, 4

Solution

1. Step 1: Understand Counting Sort logic

   Counting Sort counts occurrences of each number and then writes them back in sorted order.

2. Step 2: Trace the code with input array

   Input: {4, 2, 2, 8, 3, 3, 1} Count array: counts of 1=1, 2=2, 3=2, 4=1, 8=1 Output array after sorting: 1, 2, 2, 3, 3, 4, 8

3. Final Answer:

   1, 2, 2, 3, 3, 4, 8 -> Option B

4. Quick Check:

   Counting Sort output = sorted array [OK]

Hint: Counting Sort outputs sorted array by frequency count [OK]

Common Mistakes:

• Assuming original array remains unchanged
• Confusing Counting Sort with reverse order
• Miscounting frequencies

4. The following code attempts to implement Radix Sort but has a bug. What is the error?

void RadixSort(int[] arr) {
    int max = arr.Max();
    for (int exp = 1; max / exp > 0; exp *= 10) {
        CountingSortByDigit(arr, exp);
    }
}

void CountingSortByDigit(int[] arr, int exp) {
    int n = arr.Length;
    int[] output = new int[n];
    int[] count = new int[10];

    for (int i = 0; i < n; i++)
        count[(arr[i] / exp) % 10]++;

    for (int i = 1; i < 10; i++)
        count[i] += count[i - 1];

    for (int i = n - 1; i >= 0; i--) {
        output[count[(arr[i] / exp) % 10] - 1] = arr[i];
        count[(arr[i] / exp) % 10]--;
    }

    // Missing step here
}

medium

A. The loop for counting prefix sums should start from 0

B. The count array size should be 100 instead of 10

C. The exponent variable exp should be incremented by 1 each iteration

D. The sorted output array is not copied back to the original array

Solution

1. Step 1: Analyze CountingSortByDigit function

   The function builds output array sorted by digit but does not copy output back to arr.

2. Step 2: Identify missing step

   After building output, we must copy output elements back to arr to update it for next digit sorting.

3. Final Answer:

   The sorted output array is not copied back to the original array -> Option D

4. Quick Check:

   Missing copy back step = bug [OK]

Hint: Radix Sort needs copying output back each digit pass [OK]

Common Mistakes:

• Thinking count array size should be larger
• Starting prefix sum loop incorrectly
• Incrementing exp by 1 instead of multiplying by 10

5. You have an array of 1 million integers ranging from 0 to 1000. Which sorting algorithm is the most efficient choice and why?

hard

A. Counting Sort, because it sorts in O(n + k) time where k is max value

B. Heap Sort, because it uses constant extra space

C. Merge Sort, because it is stable and works well on large data

D. Quick Sort, because it has average O(n log n) time

Solution

1. Step 1: Analyze input size and range

   Array size n = 1,000,000; max value k = 1000 (small compared to n).

2. Step 2: Compare algorithm complexities

   Counting Sort runs in O(n + k) which is O(1,001,000) here, faster than O(n log n) for comparison sorts.

3. Step 3: Choose best algorithm

   Counting Sort is efficient for small range large data, so best choice.

4. Final Answer:

   Counting Sort, because it sorts in O(n + k) time where k is max value -> Option A

5. Quick Check:

   Small range + large n = Counting Sort best [OK]

Hint: Use Counting Sort for large arrays with small value range [OK]

Common Mistakes:

• Choosing Quick Sort ignoring small range advantage
• Preferring Merge Sort for speed over Counting Sort
• Ignoring Counting Sort's linear time benefit