Comparison Based vs Non Comparison Based Sorting in DSA Go - Key Differences

Recall & Review

beginner

What is comparison based sorting?

Sorting methods that decide the order by comparing elements with each other, like checking if one is bigger or smaller than another.

beginner

Name two common comparison based sorting algorithms.

Bubble Sort and Quick Sort are examples where elements are compared to sort the list.

beginner

What is non comparison based sorting?

Sorting methods that do not compare elements directly but use other properties like counting or digit positions to sort.

beginner

Give an example of a non comparison based sorting algorithm.

Counting Sort is a non comparison based method that counts occurrences to sort elements.

intermediate

Why can non comparison based sorting be faster than comparison based sorting?

Because they use direct information like counts or digit positions, they can sort in linear time for certain data, unlike comparison sorts which need at least n log n steps.

Which sorting method uses direct element comparisons?

A Comparison based sorting

B Non comparison based sorting

C Counting Sort

D Bucket Sort

Comparison based sorting relies on comparing elements to decide order.

Which algorithm is an example of non comparison based sorting?

A Merge Sort

B Quick Sort

C Counting Sort

D Heap Sort

Counting Sort uses counts of elements instead of comparisons.

What is the best time complexity lower bound for comparison based sorting?

A O(n log n)

B O(n^2)

C O(n)

D O(log n)

Comparison based sorting cannot be faster than O(n log n) in the general case.

Which sorting type can achieve linear time sorting under certain conditions?

A Comparison based sorting

B Non comparison based sorting

C Bubble Sort

D Insertion Sort

Non comparison based sorting like Counting Sort can run in O(n) time if data fits constraints.

Radix Sort is an example of which sorting category?

A Comparison based sorting

B In-place sorting

C Divide and conquer sorting

D Non comparison based sorting

Radix Sort sorts numbers by digits without direct comparisons.

Explain the main difference between comparison based and non comparison based sorting.

Think about how the algorithms decide order.

List examples of comparison based and non comparison based sorting algorithms and their typical use cases.

Consider data size and type.

Practice

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

easy

A. Merge Sort

B. Counting Sort

C. Quick 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 and indexing, not direct comparisons, so it is non-comparison based.

3. Final Answer:

   Counting Sort -> Option B

4. Quick Check:

   Counting Sort = Non-comparison based [OK]

Hint: Counting Sort uses counts, not comparisons [OK]

Common Mistakes:

• Confusing Counting Sort with Quick Sort
• Thinking Merge Sort is non-comparison based
• Assuming Heap Sort is non-comparison based

2. Which of the following is the correct syntax to call a non-comparison based sorting function CountingSort(arr []int) in Go?

easy

A. CountingSort{arr}

B. CountingSort arr

C. CountingSort(arr)

D. CountingSort->arr

Solution

1. Step 1: Recall Go function call syntax

   In Go, functions are called with the function name followed by parentheses enclosing arguments.

2. Step 2: Apply syntax to CountingSort

   Calling CountingSort with array arr is done as CountingSort(arr).

3. Final Answer:

   CountingSort(arr) -> Option C

4. Quick Check:

   Function call syntax = CountingSort(arr) [OK]

Hint: Use parentheses for function calls in Go [OK]

Common Mistakes:

• Omitting parentheses in function call
• Using braces {} instead of parentheses
• Using arrow notation which is invalid in Go

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

arr := []int{4, 2, 7, 1}
CountingSort(arr)
fmt.Println(arr)

Assuming CountingSort sorts the array in ascending order without returning a new array.

medium

A. [1 2 4 7]

B. [4 2 7 1]

C. [7 4 2 1]

D. Compilation error

Solution

1. Step 1: Understand CountingSort behavior

   CountingSort sorts the array in ascending order in-place.

2. Step 2: Apply CountingSort to arr

   Original arr is [4 2 7 1]. After sorting, arr becomes [1 2 4 7].

3. Final Answer:

   [1 2 4 7] -> Option A

4. Quick Check:

   Sorted arr = [1 2 4 7] [OK]

Hint: CountingSort sorts in ascending order in-place [OK]

Common Mistakes:

• Assuming CountingSort returns a new array
• Confusing ascending with descending order
• Thinking code causes compilation error

4. Identify the error in this Go code snippet that attempts to use Radix Sort (a non-comparison based sort):

func RadixSort(arr []int) {
  for i := 0; i < len(arr); i++ {
    // sorting logic here
  }
}

arr := []int{3, 1, 4}
RadixSort(arr)
fmt.Println(arr)

medium

A. Radix Sort requires multiple passes over digits, not just one loop

B. The function should return a new sorted array

C. The loop variable i should start from 1, not 0

D. Radix Sort cannot sort integers

Solution

1. Step 1: Understand Radix Sort process

   Radix Sort sorts numbers digit by digit, requiring multiple passes over digits.

2. Step 2: Analyze given loop

   The code loops only once over array length, missing multiple digit passes needed.

3. Final Answer:

   Radix Sort requires multiple passes over digits, not just one loop -> Option A

4. Quick Check:

   Radix Sort needs multiple digit passes [OK]

Hint: Radix Sort loops over digits, not just array elements [OK]

Common Mistakes:

• Thinking single loop is enough for Radix Sort
• Expecting Radix Sort to return new array always
• Believing Radix Sort cannot sort integers

5. You have an array of 1 million integers ranging only from 0 to 1000. Which sorting approach is best and why?

hard

A. Use Quick Sort because it has average O(n log n) time

B. Use Bubble Sort because it is simple to implement

C. Use Merge Sort because it is stable

D. Use Counting Sort because it sorts in O(n + k) time where k is range

Solution

1. Step 1: Analyze input size and range

   Array size n = 1,000,000; range k = 1001 (0 to 1000).

2. Step 2: Compare sorting complexities

   Counting Sort runs in O(n + k), which is efficient here since k is small compared to n.

3. Step 3: Choose best sorting method

   Counting Sort is faster than Quick Sort's average O(n log n) for this input.

4. Final Answer:

   Use Counting Sort because it sorts in O(n + k) time where k is range -> Option D

5. Quick Check:

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

Hint: Small range large array? Use Counting Sort [OK]

Common Mistakes:

• Choosing Quick Sort ignoring small range advantage
• Preferring Bubble Sort despite poor performance
• Ignoring Counting Sort's linear time for small range